算法题目

切莫本末倒置，做leetcode的目的不是A掉它上面所有的题目，而是提高自己的代码和解题能力。
所以不要用解题时间来衡量效果，而需要多总结和反思。
遇到某些题目属于自己不会的类型，宁可放下leetcode去读一下有关书籍的有关章节，再回来解题。
尽量每题都弄懂，会做的题目类型要熟练地持续地做对。
以我个人经验来看，花12个小时刷掉最简单的75题给你带来的提高，往往不如花12小时学习一种自己曾经不会做的题目类型并解决一两道这类题目所带来的提高要大

1、你做得太快，而不是太慢；
2、看答案是做题大忌，真去面试的话有人给你答案么；
3、如果真做不出来，看了答案，应该花更多的时间集中在这道题上，思考为什么没想到思路，自己哪里的知识有欠缺；
4、半个到一个小时做一道没见过的题本来就是面试的要求，没什么好畏难的。想做得更快，就要先从做得慢开始。

github/LeetCodeAnimation

https://leetcode-cn.com/leetbook/read/top-interview-questions/xmrwfi/

数组
https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/ +1
https://leetcode-cn.com/problems/rotate-array/ +1
https://leetcode-cn.com/problems/merge-sorted-array/ +1
https://leetcode-cn.com/problems/3sum/ +1

链表
https://leetcode-cn.com/problems/merge-two-sorted-lists/ +1
https://leetcode-cn.com/problems/swap-nodes-in-pairs/. +1

Map & Set
https://leetcode-cn.com/problems/valid-anagram/ +1
https://leetcode-cn.com/problems/group-anagrams/. -1

堆栈、队列
https://leetcode-cn.com/problems/remove-all-adjacent-duplicates-in-string/. +1
https://leetcode-cn.com/problems/remove-outermost-parentheses/ XXX
https://leetcode.com/problems/largest-rectangle-in-histogram/. -1
https://leetcode.com/problems/trapping-rain-water/. -1

二分查找
https://leetcode-cn.com/problems/arranging-coins/ +1
https://leetcode-cn.com/problems/powx-n/ +1
https://leetcode-cn.com/problems/dungeon-game/ +1xxx

递归
https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/ +1
https://leetcode-cn.com/problems/symmetric-tree/ +1
https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/ +1
https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/ +1
https://leetcode-cn.com/problems/binary-tree-paths/ +1
https://leetcode-cn.com/problems/range-sum-of-bst/ +1
https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/ +1

哈希表
https://leetcode-cn.com/problems/two-sum/ +1
https://leetcode-cn.com/problems/valid-anagram/ +1
https://leetcode-cn.com/problems/longest-substring-without-repeating-characters +1
https://leetcode-cn.com/problems/top-k-frequent-words +1
https://leetcode-cn.com/problems/number-of-atoms/ XXXX

二叉树
https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/
https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/
https://leetcode-cn.com/problems/symmetric-tree/
https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/
https://leetcode-cn.com/problems/binary-tree-level-order-traversal/
https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree/

二叉搜索树
https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/
https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-searchhttps://leetcode-cn.com/problems/validate-binary-search-tree/
https://leetcode-cn.com/problems/range-sum-of-bst/
https://leetcode-cn.com/problems/contains-duplicate-iii/
https://leetcode-cn.com/problems/count-of-smaller-numbers-after-self/

图
https://leetcode.com/problems/number-of-islands/
https://leetcode-cn.com/problems/course-schedule-ii

堆和排序
https://leetcode-cn.com/problems/kth-largest-element-in-a-stream/
https://leetcode-cn.com/problems/find-median-from-data-stream/

DFS
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/friend-circles/
https://leetcode-cn.com/problems/find-eventual-safe-states/
https://leetcode-cn.com/problems/longest-increasing-path-in-a-matrix/
https://leetcode-cn.com/problems/minesweeper/
https://leetcode-cn.com/problems/word-ladder/

BFS
https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal/
https://leetcode-cn.com/problems/binary-tree-level-order-traversal/
https://leetcode.com/problems/binary-tree-level-order-traversal-ii/
https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/
https://leetcode-cn.com/problems/minesweeper/
https://leetcode-cn.com/problems/minimum-height-trees/

Trie树
https://leetcode-cn.com/problems/longest-word-in-dictionary/
https://leetcode-cn.com/problems/implement-trie-prefix-tree/
https://leetcode-cn.com/problems/add-and-search-word-data-structure-design/
https://leetcode-cn.com/problems/word-search-ii/

分治算法
https://leetcode-cn.com/problems/majority-element/
https://leetcode-cn.com/problems/maximum-subarray/
https://leetcode-cn.com/problems/search-a-2d-matrix-ii/

贪心算法
https://leetcode-cn.com/problems/assign-cookies/
https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/

回溯算法
https://leetcode-cn.com/problems/letter-case-permutation/
https://leetcode-cn.com/problems/subsets/
https://leetcode-cn.com/problems/permutations/
https://leetcode-cn.com/problems/combinations/
https://leetcode-cn.com/problems/n-queens/

动态规划
https://leetcode-cn.com/problems/climbing-stairs/
https://leetcode.com/problems/house-robber/
https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/
https://leetcode.com/problems/house-robber-ii/
https://leetcode.com/problems/house-robber-iii/
https://leetcode.com/problems/unique-paths/ XXX
https://leetcode.com/problems/unique-paths-ii/ XXX
https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/ XXX
https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/ XXX