Table of Contents generated with DocToc
- LetCode
- 刷题思路
- 第01课|刷题顺序
- 第02课丨Array
- 第03课丨Linked List
- 第04课丨栈、队列、优先队列、双端队列
- 第05课丨哈希表、映射、集合
- 第06课丨树、二叉树、二叉搜索树
- 第07课丨递归、泛型递归、树的递归
- 第08课丨 分治、回溯
- 第09课丨深度优先搜索、广度优先搜索
最后给小白一个刷题顺序，帮助大家最大化利用自己的时间。
基础永远是最重要的，先把最最基础的这些搞熟，磨刀不误砍柴工。
- 数组，队列，栈
- 链表
- 树与递归
- 哈希表
- 双指针
这些思想是投资回报率极高的，强烈推荐每一个小的专题花一定的时间掌握。
- 二分
- 滑动窗口
- 搜索（BFS，DFS，回溯）
- 动态规划
这部分收益没那么明显，并且往往需要一定的技术积累。出现的频率相对而言比较低。但是有的题目需要你使用这些技巧。又或者可以使用这些技巧可以实现**「降维打击」**。
- 贪心
- 分治
- 位运算
- KMP & RK
- 并查集
- 前缀树
- 线段树
- 堆
- https://leetcode-cn.com/problems/container-with-most-water/
- https://leetcode-cn.com/problems/move-zeroes/
- https://leetcode.com/problems/climbing-stairs/
- https://leetcode-cn.com/problems/two-sum/ (两数之和)
- https://leetcode-cn.com/problems/3sum/ (高频老题）
· https://leetcode.com/problems/reverse-linked-list/ https://leetcode-cn.com/problems/fan-zhuan-lian-biao-lcof/
· https://leetcode.com/problems/swap-nodes-in-pairs
· https://leetcode.com/problems/linked-list-cycle *
· https://leetcode.com/problems/linked-list-cycle-ii
· https://leetcode.com/problems/reverse-nodes-in-k-group/
· https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/
· https://leetcode-cn.com/problems/rotate-array/
· https://leetcode-cn.com/problems/merge-two-sorted-lists/
· https://leetcode-cn.com/problems/merge-sorted-array/
· https://leetcode-cn.com/problems/two-sum/
· https://leetcode-cn.com/problems/move-zeroes/
· https://leetcode-cn.com/problems/plus-one/
· https://leetcode-cn.com/problems/valid-parentheses/
· https://leetcode-cn.com/problems/min-stack/
· https://leetcode-cn.com/problems/largest-rectangle-in-histogram
· https://leetcode-cn.com/problems/sliding-window-maximum
· 用 add first 或 add last 这套新的 API 改写 Deque 的代码
· 分析 Queue 和 Priority Queue 的源码
· https://leetcode.com/problems/design-circular-deque
· https://leetcode.com/problems/trapping-rain-water/
• https://leetcode-cn.com/problems/valid-anagram/description/
• https://leetcode-cn.com/problems/group-anagrams/
· https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
· https://leetcode-cn.com/problems/binary-tree-preorder-traversal/
· https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal/
· https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal/
· https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal/
· https://leetcode-cn.com/problems/climbing-stairs/
· https://leetcode-cn.com/problems/generate-parentheses/
· https://leetcode-cn.com/problems/invert-binary-tree/description/
· https://leetcode-cn.com/problems/validate-binary-search-tree
· https://leetcode-cn.com/problems/maximum-depth-of-binary-tree
· https://leetcode-cn.com/problems/minimum-depth-of-binary-tree
· https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree/
· https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/
· https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal
· https://leetcode-cn.com/problems/combinations/
· https://leetcode-cn.com/problems/permutations/
· https://leetcode-cn.com/problems/permutations-ii/
· https://leetcode-cn.com/problems/powx-n/
· https://leetcode-cn.com/problems/subsets/
· 括号生成问题
· https://leetcode-cn.com/problems/majority-element/description/ （简单、但是高频）
· https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/
· https://leetcode-cn.com/problems/n-queens/
· https://leetcode-cn.com/problems/binary-tree-level-order-traversal/#/description
· https://leetcode-cn.com/problems/minimum-genetic-mutation/#/description
· https://leetcode-cn.com/problems/generate-parentheses/#/description
· https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row/#/description
· https://leetcode-cn.com/problems/word-ladder/description/
· https://leetcode-cn.com/problems/word-ladder-ii/description/