basic algorithm- 20190416-20190425
binary search
14.https://www.lintcode.com/problem/first-position-of-target/description
SRE实战 互联网时代守护先锋，助力企业售后服务体系运筹帷幄！一键直达领取阿里云限量特价优惠。74.https://www.lintcode.com/problem/first-bad-version/description
Tree
97.https://www.lintcode.com/problem/maximum-depth-of-binary-tree/description
480.https://www.lintcode.com/problem/binary-tree-paths/description
596.https://www.lintcode.com/problem/minimum-subtree/description
93.https://www.lintcode.com/problem/balanced-binary-tree/description
578.https://www.lintcode.com/problem/lowest-common-ancestor-iii/description
95.https://www.lintcode.com/problem/validate-binary-search-tree/description
BFS
69.https://www.lintcode.com/problem/binary-tree-level-order-traversal/description 70.71
7.https://www.lintcode.com/problem/serialize-and-deserialize-binary-tree/description
178.https://www.lintcode.com/problem/graph-valid-tree/description
127.https://www.lintcode.com/problem/topological-sorting/description 拓扑
433.https://www.lintcode.com/problem/number-of-islands/description
432.https://www.lintcode.com/problem/connected-component-in-undirected-graph/description
DFS
135.https://www.lintcode.com/problem/combination-sum/description
153.https://www.lintcode.com/problem/combination-sum-ii/description 选代表条件： i>0 && num[i]==num[i-1] && i!=index
136.https://www.lintcode.com/problem/palindrome-partitioning/description
15.https://www.lintcode.com/problem/permutations/description 排列
16.https://www.lintcode.com/problem/permutations-ii/description 选代表条件：i>0 && nums[i]==nums[i-1] && visited[i-1]=false
list
65.https://www.lintcode.com/problem/median-of-two-sorted-arrays/description
twoSum:
100.https://www.lintcode.com/problem/remove-duplicates-from-sorted-array/description
101.https://www.lintcode.com/problem/remove-duplicates-from-sorted-array-ii/description could do 2nd time
604.https://www.lintcode.com/problem/window-sum/description
415.https://www.lintcode.com/problem/valid-palindrome/description
891.https://www.lintcode.com/problem/valid-palindrome-ii/description
56.https://www.lintcode.com/problem/two-sum/description
609.https://www.lintcode.com/problem/two-sum-less-than-or-equal-to-target/description
608.https://www.lintcode.com/problem/two-sum-ii-input-array-is-sorted/description
607.https://www.lintcode.com/problem/two-sum-iii-data-structure-design/description
57.https://www.lintcode.com/problem/3sum/description
59.https://www.lintcode.com/problem/3sum-closest/description
918.https://www.lintcode.com/problem/3sum-smaller/description
382.https://www.lintcode.com/problem/triangle-count/description
31.https://www.lintcode.com/problem/partition-array/description
373.https://www.lintcode.com/problem/partition-array-by-odd-and-even/description
148.https://www.lintcode.com/problem/sort-colors/description
143.https://www.lintcode.com/problem/sort-colors-ii/description
heap&hash
129.https://www.lintcode.com/problem/rehashing/description reharshing
134.https://www.lintcode.com/problem/lru-cache/description LRU Cache
517.https://www.lintcode.com/problem/ugly-number/description
4.https://www.lintcode.com/problem/ugly-number-ii/description
54.https://www.lintcode.com/problem/top-k-largest-numbers/description
545.https://www.lintcode.com/problem/top-k-largest-numbers-ii/description
612.https://www.lintcode.com/problem/k-closest-points/description
104.https://www.lintcode.com/problem/merge-k-sorted-lists/description
81.https://www.lintcode.com/problem/find-median-from-data-stream/description
401.https://www.lintcode.com/problem/kth-smallest-number-in-sorted-matrix/description
DP:
109.https://www.lintcode.com/problem/triangle/description
110.https://www.lintcode.com/problem/minimum-path-sum/description
114.https://www.lintcode.com/problem/unique-paths/description
115.https://www.lintcode.com/problem/unique-paths-ii/description
679.https://www.lintcode.com/problem/unique-paths-iii/description
111.https://www.lintcode.com/problem/climbing-stairs/description
1054.https://www.lintcode.com/problem/min-cost-climbing-stairs/description
116.https://www.lintcode.com/problem/jump-game/description 解答：http://www.cnblogs.com/yuzhangcmu/p/4039840.html
117.https://www.lintcode.com/problem/jump-game-ii/description resolve:http://www.cnblogs.com/yuzhangcmu/p/4148858.html DP&Greedy
76.https://www.lintcode.com/problem/longest-increasing-subsequence/description LIS
1093.https://www.lintcode.com/problem/number-of-longest-increasing-subsequence/description
