LeetCode 需要巩固的题目

http://oj.leetcode.com/problems/binary-tree-inorder-traversal/    迭代解

http://oj.leetcode.com/problems/n-queens-ii/ 对角线的编号方法

http://oj.leetcode.com/problems/linked-list-cycle-ii/  寻找圆圈的写法会影响程序的正确性

http://oj.leetcode.com/problems/container-with-most-water/ 思路错误

http://oj.leetcode.com/problems/longest-consecutive-sequence/ 不用A[MAX_IN_ARRAY]浪费空间。

http://oj.leetcode.com/problems/subsets-ii/  

http://oj.leetcode.com/problems/convert-sorted-list-to-binary-search-tree/  自底向上的方法，O(n)的时间复杂度。

http://oj.leetcode.com/problems/3sum-closest/ 深搜超时

http://oj.leetcode.com/problems/permutations-ii/

http://oj.leetcode.com/problems/distinct-subsequences/ 动态规划，初始状态的设置不太好理解

http://oj.leetcode.com/problems/gas-station/ 线性解思路

http://oj.leetcode.com/problems/jump-game-ii/

http://oj.leetcode.com/problems/recover-binary-search-tree/ Morris遍历

http://oj.leetcode.com/problems/scramble-string/ 动态规划状态定义

http://oj.leetcode.com/problems/4sum/ 排序，左右加逼超时。

http://oj.leetcode.com/problems/clone-graph/ 细节实现，不熟练

http://oj.leetcode.com/problems/permutation-sequence/ 不熟练

http://oj.leetcode.com/problems/maximal-rectangle/ 完全没思路

http://oj.leetcode.com/problems/implement-strstr/  KMP算法

http://oj.leetcode.com/problems/longest-palindromic-substring/  Manacher算法

http://oj.leetcode.com/problems/largest-rectangle-in-histogram/ 递增栈的使用，可推广的技巧

http://oj.leetcode.com/problems/word-break/  深搜超时

http://oj.leetcode.com/problems/word-break-ii/  动态规划路径生成

http://oj.leetcode.com/problems/spiral-matrix/ 细节实现题，很繁琐

http://oj.leetcode.com/problems/regular-expression-matching/  细节实现，很繁琐，不熟练

http://oj.leetcode.com/problems/binary-tree-maximum-path-sum/　　不能一遍写对，思路有问题

http://oj.leetcode.com/problems/word-search/ 同是深搜，不同的写法可能超时

http://oj.leetcode.com/problems/simplify-path/ 不能一遍写对，思路有问题

http://oj.leetcode.com/problems/longest-valid-parentheses/  不能一遍写对，思路有问题

http://oj.leetcode.com/problems/palindrome-partitioning-ii/　思路有问题

http://oj.leetcode.com/problems/word-ladder/ 宽搜，思路很简单，但是需要注意的是图的宽搜，一定要记录已经访问过的节点，不然有环的话，会死循环

http://oj.leetcode.com/problems/word-ladder-ii/  比第一个难

http://oj.leetcode.com/problems/substring-with-concatenation-of-all-words/  暴力方法超时，Map的操作细节，使用迭代器可以节省时间

http://oj.leetcode.com/problems/minimum-window-substring/ 思路不对

http://oj.leetcode.com/problems/decode-ways/  DP，特别注意“0”的处理

http://oj.leetcode.com/problems/median-of-two-sorted-arrays/ 注意边界条件

http://oj.leetcode.com/problems/divide-two-integers/ 溢出

http://oj.leetcode.com/problems/max-points-on-a-line/  O(n2)解法

http://oj.leetcode.com/problems/valid-number/

http://oj.leetcode.com/problems/wildcard-matching/ 递归超时，DP解法比较好理解

http://oj.leetcode.com/problems/lru-cache/  STL List 的使用