0001 two sum 哈希表
0002 add two numbers linkedlist
0003 longest substring without repeating characters sliding window
0004 median of two sorted arrays 1.分治 2.sort
[0005 longest palindrome substring] dp
[0006 ZigZag Conversion]
[0007 Reverse Integer]
[0008 String to Integer (atoi)]
[0009 Palindrome Number]
[0010 Regular Expression Matching]
0011 Container with most water 双指针
[0012 Integer to roman]
[0013 Roman to integer]
[0014 longest common prefix]
[0015 3sum]
0017 电话号码的字母组合 backtracking
[0020 valid parentheses]
0021 merge two sorted lists 谁小移谁
0022 括号生成 backtracking
[0025 reverse linked list in k group]
0026 remove duplicates from sorted array 双指针
0030 substring with concatenation of all words
0042 trapping rain water
0046 permutation backtracking
0049 group anagrams
0050 pow 分治
[0051 N queens] 分治
0053 largest subarray sum dp, prefix sum
followup: largest subarray sum with at least k elements
followup: larget subarray sum with at most k elements
0062 unique paths
0066 plus one 模拟题
0070 climbing stairs dp
0077 combinations backtracking
0078 subsets backtracking, recursion, dp
0084 largest rectangle in histogram
0088 merge sorted array 谁小移谁
0105 从前序和中序遍历序列构造二叉树
[0121 买卖股票的最佳时机I]
[0122 买卖股票的最佳时机II]
[0123 买卖股票的最佳时机III]
0132 palindrome partitioning II
0139 word break
0141 环形链表
0146 LRU cache 双链表+hashtable
[0150 后缀表达式求值]
0152 maximum product subarray
[0155 min stack]
0167 two sum II(sorted) two pointer
0169 majority elemen 哈希表计数/排序/摩尔投票法Boyer–Moore majority vote algorithm
[0188 买卖股票的最佳时机] dp
0198 house robber dp
0206 reverse linked list
0207 课程表
0226 invert binary tree
0236 lowest common ancestor of a binary tree
0239 滑动窗口最大值
0283 move zeros 双指针
0279 perfect squares
0297 二叉树的序列化与反序列化
0300 longest increasing subsequence
[longest increasing/ascenidng subarray] dp
0303 range sum query(immutable) 前缀和
0304 range sum query 2d 前缀和
0315 coutn of smaller numbers after self 逆序对/树状数组
0322 coin change dp
0329 longest increasing path in a matrix recursion+memo
[0354 russian doll envelop]
0355 design twitter
[0363 max sum of rectqangle no larger than k]
lintcode.0385 arraylist
0410 split array largest sum
0429 N叉树的层序遍历
0433 minimum generic mutation
[0450 delete in binary search tree]
[0463 minimum generic mutation]
0465 optimal account balancing
0468 valid ip address 纯编程题
0509 fibonacci number
0525 contiguous array
0589 N叉树的前序遍历
0611 valid triangle number
0622 design circular queue
0641 design circular deque
0684 冗余连接
[0700 search in a binary search tree]
[0701 insert in binary serach tree]
0746 min cost climbing stairs dp
0773 sliding puzzle
0811 subdomain visit count 哈希表
0814 binary tree pruning recursion
0874 walking robot simulation 哈希表
[0911 complete binary tree inserter]
0918 largest subarray sum of circular array
0919 complete binary tree inserter
[0961 重复N次的元素]
[0962 最大宽度坡]
[0963 ]
0981 time based key-value store 基于时间的键值存储 哈希表+二分 / 哈希表+treemap
[0982 triples with bitwise and equal to zero 按位与位零的三元组]
[0983 最低票价]
[0984 不含AAA或BBB的字符串]
[0985 查询后的偶数和]
[0986 区间列表的交集]
[0987 二叉树的垂序遍历]
[0988 从叶节点开始的最小字符串]
[0989 数组形式的整数加法]
[0990 等式方程的可满足行]
[1042 flow planting with no adjacent]
1094 car pooling 差分
1108 ip地址无效化 纯编程题
1109 corporate flight bookings 差分
[1137 n-th tribonacci number] dp
1143 longest common subsequence dp
1177 can make palindrome from substring 前缀和差分
1245 树的直径
1248 coutn number nice arrays 前缀和
[1262 greatest sum divisible by three]