| # | Title | Solution | Tag |

|---| ----- | -------- | ---------- |

|938|Range Sum of BST|[dfs](./easy/tree/938_Range_Sum_of_BST.py), [devide and conquer](./easy/tree/938_Range_Sum_of_BST-DivideAndConquer.py)|tree|

|687|最长同值路径|[Recursive](./easy/tree/687.最长同值路径.py)|tree|

|617|Merge Two Binary Trees|[Recursive](./easy/tree/617_Merge_Two_Binary_Trees.py)|tree|

|590|n叉树的后序遍历|[Recursive](./easy/tree/590.n叉树的后序遍历.py)|tree|

|572|Subtree of Another Tree|[Recursive](./easy/tree/572.py)|tree|

|543|二叉树的直径|[Recursive](./easy/tree/543.二叉树的直径(recursive).py), [divide and conquer](./easy/tree/543.二叉树的直径(divideandconquer).py)|tree|

|226|翻转二叉树|[Recursive](./easy/tree/226.翻转二叉树.py)|tree|

|202|happyNumber|[array](./easy/array/202.happyNumber.py)|array|

|155|minStack|[stack](./easy/stack/155.py)|stack|

|111|二叉树的最小深度|[Recursive](./easy/tree/111.二叉树的最小深度.py), [dfs-todo](./)|tree|

|110|平衡二叉树|[Recursive](./easy/tree/110.平衡二叉树.py)|tree|

|104|二叉树的最大深度|[Recursive](./easy/tree/104.二叉树的最大深度.py)|tree|

|100|相同的树|[Recursive](./easy/tree/100.相同的树.py)|tree|

|94|二叉树的中序遍历|[Recursive](./easy/tree/94.二叉树的中序遍历-recursive.py)|tree|

|70|爬楼梯|[dp](./easy/dp/70.爬楼梯.py)|dp|

|53|最大子序和|[dp](./easy/dp/53.最大子序和.py)|dp|

|26|删除排序数组中的重复项|[swap](./easy/array/26.删除排序数组中的重复项.py)|array|

|1|两数之和|[hash](./easy/array/1.两数之和.py)|array|

| # | Title | Solution | Tag |

|---| ----- | -------- | ---------- |

|1111|有效括号的嵌套深度|[stack](./medium/stack/1111.有效括号的嵌套深度.py)|stack|

|445|两数相加ii|[stack](./medium/445.两数相加-ii.py)|stack|

|355|设计推特|[design](./medium/design/355.设计推特.py)|design|

|289|生命游戲|[convolution](./每日一題/289.生命游戏(convolution).py)|array|

|200|岛屿数量|[dfs](./medium/dfs/200.岛屿数量.py) [bfs](./)|搜索|

|199|二叉树的右视图|[dfs](./medium/tree/199.二叉树的右视图.py)|tree|

|151|翻转字符串里的单词|[spilit](./每日一題/151.翻转字符串里的单词.py)|string|

|130|被围绕的区域|[dfs](./medium/dfs/130.被围绕的区域.py)|搜索|

|98|验证二叉搜索树|[devide and conquer](./medium/tree/98.验证二叉搜索树.py), 也可中序遍歷是否從小到大排序[recursive](./medium/tree/98.py)|tree|

|96|不同的二叉搜索树|[DP](./medium/tree/96.不同的二叉搜索树.py)|tree|

|90|子集-ii|[backtracking](./medium/dfs/90.子集-ii.py)|dfs|

|78|子集|[backtracking](./medium/dfs/78.子集.py)|dfs|

|56|合併區間|[sort](./medium/array/56.合并区间.py)|array|

|55|跳跃游戏|[greedy](./medium/array/55.跳跃游戏.py)|array|

|50|pow|[recursive](./medium/divide_and_conquer/50.py)|divide_and_conquer|

|47|全排列-ii|[backtracking](./medium/dfs/47.全排列-ii.py)|dfs|

|46|全排列|[backtracking](./medium/dfs/46.全排列.py)|dfs|

|39|组合总和|[dfs](./medium/dfs/39.组合总和.py)|dfs|

|33|搜索旋转排序数组|[binary_search](./medium/binary_search/33.搜索旋转排序数组.py)|binary_search|

|22|括号生成|[dfs](./每日一題/22.括号生成.py)|backtraking|

|11|盛最多水的容器|[two_pointer](./medium/two_pointer.py)|two_pointer|

|8|atoi|[array](./每日一題/8.字符串转换整数-atoi.py)|string|

|2|两数相加|[list](./medium/stack/2.两数相加.py)|list|

| # | Title | Solution | Tag |

|---| ----- | -------- | ---------- |

|887|鸡蛋掉落|[dp1](./hard/dp/887.鸡蛋掉落(TLE).py), [dp + binarySearch](./hard/dp/887.鸡蛋掉落(dp+binarySearch).py), [dp2-todo](./)|dp|

|99|恢复二叉搜索树|[O(n)traversal](./hard/tree/99.恢复二叉搜索树_O(n).py), [refine traversal 解法](./hard/tree/99.恢复二叉搜索树(refine).py), [Morris算法](./tree/99.恢复二叉搜索树.py)|tree|

|72|编辑距离|[dp](./hard/dp/72.编辑距离.py)|dp|

|45|跳跃游戏II|[dfs](./hard/dp/45.py)|dfs|

|42|接雨水|[dp](./hard/array/42.接雨水.py)|array|

|23|合并k个排序链表|[priority_queue](./hard/priority_queue/23.合并k个排序链表.py)|priority_queue|

| # | Title | Solution | Tag |

|---| ----- | -------- | ---------- |

| # | Title | Solution | Tag |

|---| ----- | -------- | ---------- |

| # | Title | Solution | Tag |

|---| ----- | -------- | ---------- |