Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.
Awesome Lists | Featured Topics | Projects
https://github.com/Perry961002/Algorithms-LeetCode

:art:I practiced some LeetCode's algorithm problems with C++, Java, Python and Go, and also implemented some classical algorithms.
https://github.com/Perry961002/Algorithms-LeetCode
algorithmic-trading c-plus-plus go java python3
Last synced: about 2 months ago
JSON representation
:art:I practiced some LeetCode's algorithm problems with C++, Java, Python and Go, and also implemented some classical algorithms.
Host: GitHub
URL: https://github.com/Perry961002/Algorithms-LeetCode
Owner: Perry961002
License: mit
Created: 2018-07-02T04:59:03.000Z (about 6 years ago)
Default Branch: master
Last Pushed: 2019-07-06T10:34:48.000Z (about 5 years ago)
Last Synced: 2024-05-18T02:01:35.932Z (4 months ago)
Topics: algorithmic-trading, c-plus-plus, go, java, python3
Language: C++
Homepage:
Size: 12.9 MB
Stars: 29
Watchers: 3
Forks: 12
Open Issues: 0
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project

awesome-golang-repositories - Algorithms-LeetCode
README

        # Algorithms change the world

[![C++](https://img.shields.io/badge/language-C++-red.svg)](https://github.com/Perry961002/Algorithms-LeetCode#leetcode%E5%88%B7%E9%A2%98)	[![Java](https://img.shields.io/badge/language-Java-yellow.svg)](https://github.com/Perry961002/Algorithms-LeetCode#leetcode%E5%88%B7%E9%A2%98)	[![Python](https://img.shields.io/badge/language-Python3-blue.svg)](https://github.com/Perry961002/Algorithms-LeetCode#leetcode%E5%88%B7%E9%A2%98)	[![Go](https://img.shields.io/badge/language-Go-deepskyblue.svg)](https://github.com/Perry961002/Algorithms-LeetCode#leetcode%E5%88%B7%E9%A2%98)	[![MIT license](https://img.shields.io/dub/l/vibe-d.svg) ](https://github.com/Perry961002/LeetCode/blob/master/LICENSE)

![Image text](image.jpg)

## 经典算法的实现(使用C++11标准):

- 🔧[逆波兰符实现](https://github.com/Perry961002/LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/%E9%80%86%E6%B3%A2%E5%85%B0%E7%AC%A6.cpp)

- 🔧[Manacher算法](https://github.com/Perry961002/LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/Manacher.cpp)

- 🔧字符串匹配算法

    - [朴素字符串匹配算法](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D/Naive-String-Macher.cpp)

    - [Rabin-Karp算法](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D/Rabin_Karp_Matcher.cpp)

    - [有限自动机的字符串匹配算法](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D/Finite_Automaton_Matcher.cpp)

    - [KMP算法](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D/KMP.cpp)

- 🔧[哈夫曼编码算法](https://github.com/Perry961002/LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/Huffman.cpp)

- 🔧[快速排序的递归和非递归实现](https://github.com/Perry961002/LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/QuickSort.cpp)

- 🔧[堆排序和优先队列](https://github.com/Perry961002/LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/%E5%A0%86%E6%8E%92%E5%BA%8F%E4%B8%8E%E4%BC%98%E5%85%88%E9%98%9F%E5%88%97.cpp)

- 🔧[桶排序](https://github.com/Perry961002/LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/BucketSort.cpp)

- 二叉树(以下代码都是在刷LeetCode时写的, 所有只有功能函数, 请见谅！另外前序、中序、后序遍历算法都给出了递归和非递归两种实现方式)

    - [二叉树的前序遍历](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/C%2B%2B%E7%89%88/144-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.cpp)

    - [二叉树的中序遍历](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/C%2B%2B%E7%89%88/094-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86.cpp)

    - [二叉树的后序遍历](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/C%2B%2B%E7%89%88/145-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86.cpp)

    - [二叉树的层次遍历](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/C%2B%2B%E7%89%88/102-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E6%AC%A1%E9%81%8D%E5%8E%86.cpp)

    - [从前序和中序遍历序列构造二叉树](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/C%2B%2B%E7%89%88/105-%E5%89%8D%E5%BA%8F%E4%B8%AD%E5%BA%8F%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.cpp)

    - [从中序和后序遍历序列构造二叉树](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/C%2B%2B%E7%89%88/106-%E4%B8%AD%E5%BA%8F%E5%90%8E%E5%BA%8F%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.cpp)

- 🔧[二叉搜索树(BST)](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/BST.cpp)(其中删除节点操作在LeetCode刷题时使用了[递归方法](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/450-%E5%88%A0%E9%99%A4%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.cpp), 中序遍历给出了递归、使用栈的非递归以及不使用栈的非递归实现)

- 🔧[一种自平衡二叉搜索树---红黑树](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/RB_Tree)

- 🔧图的两种遍历方式

    - [广度优先遍历](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/Graph_Search/BFS.cpp) 这种方式最终会生成关于图的一棵广度优先树, 得到源点s到其余点的最短路径(边数最少)

    - [深度优先遍历](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/Graph_Search/DFS.cpp) 这种方式最终会生成关于图的深度优先森林, 节点访问时间和结束时间具有括号化结构

- 🔧[有向无环图的拓扑排序算法](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/Topological_Sort.cpp)

- 🔧最小生成树

    - [Kruskal算法](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/%E6%9C%80%E5%B0%8F%E7%94%9F%E6%88%90%E6%A0%91/Kruskal.cpp)

    - [Prim算法](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/%E6%9C%80%E5%B0%8F%E7%94%9F%E6%88%90%E6%A0%91/Prim.cpp)

- 🔧单源点最短路径

    - [一般情况下的Bellman-Ford算法](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/%E5%8D%95%E6%BA%90%E7%82%B9%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84/Bellman_Ford.cpp)

    - [有向无环图的基于拓扑排序的DAG算法](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/%E5%8D%95%E6%BA%90%E7%82%B9%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84/DAG_Shortest_Paths.cpp)

    - [使用动态规划的非负权重有向图的Dijkstra算法](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/%E5%8D%95%E6%BA%90%E7%82%B9%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84/Dijkstra.cpp)

- 🔧所有节点对最短路径

    - [基于重复平方矩阵乘法的动态规划算法](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/%E6%89%80%E6%9C%89%E8%8A%82%E7%82%B9%E5%AF%B9%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E9%97%AE%E9%A2%98/Faster_APSP.cpp)

    - [Floyd-Warshall算法](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/%E6%89%80%E6%9C%89%E8%8A%82%E7%82%B9%E5%AF%B9%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E9%97%AE%E9%A2%98/Floyd_Warshall.cpp)

    - [有向图的传递闭包求解算法](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%9E%E7%8E%B0/%E6%89%80%E6%9C%89%E8%8A%82%E7%82%B9%E5%AF%B9%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E9%97%AE%E9%A2%98/Transitive_Closure.cpp)

## 部分题目的证明:

 - 🔧[第287题证明(映射,环检测)](https://github.com/Perry961002/LeetCode/blob/master/%E9%83%A8%E5%88%86%E9%A2%98%E7%9B%AE%E7%9A%84%E5%88%86%E6%9E%90%E5%92%8C%E8%AF%81%E6%98%8E/287%E9%97%AE%E9%A2%98%E5%88%86%E6%9E%90.pdf)

 - 🔧[309题状态机用到动态规划](https://github.com/Perry961002/LeetCode/blob/master/%E9%83%A8%E5%88%86%E9%A2%98%E7%9B%AE%E7%9A%84%E5%88%86%E6%9E%90%E5%92%8C%E8%AF%81%E6%98%8E/309%E9%A2%98%E7%9A%84%E6%80%9D%E8%B7%AF%E8%A7%A3%E5%86%B3.pdf)

 - 🔧[Catalan公式证明(建立双射法)](https://github.com/Perry961002/LeetCode/blob/master/%E9%83%A8%E5%88%86%E9%A2%98%E7%9B%AE%E7%9A%84%E5%88%86%E6%9E%90%E5%92%8C%E8%AF%81%E6%98%8E/Catalan.pdf)

 - 🔧[回文子串问题(Manacher算法的说明)](https://github.com/Perry961002/LeetCode/blob/master/%E9%83%A8%E5%88%86%E9%A2%98%E7%9B%AE%E7%9A%84%E5%88%86%E6%9E%90%E5%92%8C%E8%AF%81%E6%98%8E/%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2%E9%97%AE%E9%A2%98.pdf)

 - 🔧[环链表问题(快慢指针法的证明)](https://github.com/Perry961002/LeetCode/blob/master/%E9%83%A8%E5%88%86%E9%A2%98%E7%9B%AE%E7%9A%84%E5%88%86%E6%9E%90%E5%92%8C%E8%AF%81%E6%98%8E/%E7%8E%AF%E9%93%BE%E8%A1%A8%E9%97%AE%E9%A2%98.pdf)

 - 🔧编辑距离问题([算法导论中6种字符操作](https://github.com/Perry961002/LeetCode/blob/master/%E9%83%A8%E5%88%86%E9%A2%98%E7%9B%AE%E7%9A%84%E5%88%86%E6%9E%90%E5%92%8C%E8%AF%81%E6%98%8E/%E7%AE%97%E6%B3%95%E5%AF%BC%E8%AE%BA_%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB.pdf), [LeetCode中3种字符操作](https://github.com/Perry961002/LeetCode/blob/master/%E9%83%A8%E5%88%86%E9%A2%98%E7%9B%AE%E7%9A%84%E5%88%86%E6%9E%90%E5%92%8C%E8%AF%81%E6%98%8E/%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB%E9%97%AE%E9%A2%98.pdf))

## LeetCode刷题:

- :tada: 感谢[gzh](https://github.com/gzh205)提供了Java的解题代码。

- C++、Python、Go的代码由我完成。

|  ID  |                            Title                             | Difficulty |                     C++                      |                     Java                      |                     Python                      |                     Go                     |

| :--: | :----------------------------------------------------------: | :--------: | :----------------------------------------------------------: | :----------------------------------------------------------: | :----------------------------------------------------------: | :----------------------------------------------------------: |

| 001 |		[两数之和](https://leetcode-cn.com/problems/two-sum/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/001-%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/001-%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/001-Two_Sum.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/001-two-sum.go) |

| 002 |		[两数相加](https://leetcode-cn.com/problems/add-two-numbers/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/002-%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/002-%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/002-add-two-numbers.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/002-add-two-numbers.go) |

| 003 |		[无重复字符的最长子串](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/003-%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/003-%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/003-longest-substring-without-repeating-characters.py)                      |                                            |

| 004 |		[两个排序数组的中位数](https://leetcode-cn.com/problems/median-of-two-sorted-arrays/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/004-%E4%B8%A4%E4%B8%AA%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/004-%E4%B8%A4%E4%B8%AA%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/004-median-of-two-sorted-arrays.py)                      |                                            |

| 005 |		[最长回文子串](https://leetcode-cn.com/problems/longest-palindromic-substring/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/005-%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/005-%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/005-longest-palindromic-substring.py)                      |                                            |

| 006 |		[Z字形变换](https://leetcode-cn.com/problems/zigzag-conversion/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/006-Z%E5%AD%97%E5%BD%A2%E5%8F%98%E6%8D%A2.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/006-Z%E5%AD%97%E5%BD%A2%E5%8F%98%E6%8D%A2.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/006-zigzag-conversion.py)                      |                                            |

| 007 |		[反转整数](https://leetcode-cn.com/problems/reverse-integer/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/007-%E5%8F%8D%E8%BD%AC%E6%95%B4%E6%95%B0.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/007-%E5%8F%8D%E8%BD%AC%E6%95%B4%E6%95%B0.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/007-reverse-integer.py)                      |                                            |

| 008 |		[字符串转整数 (atoi)](https://leetcode-cn.com/problems/string-to-integer-atoi/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/008-%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E6%95%B4%E6%95%B0%20(atoi).cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/008-字符串转整数.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/008-string-to-integer-atoi.py)                      |                                            |

| 009 |		[回文数](https://leetcode-cn.com/problems/palindrome-number/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/009-%E5%9B%9E%E6%96%87%E6%95%B0.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/009-回文数.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/009-palindrome-number.py)                      |                                            |

| 010 |		[正则表达式匹配](https://leetcode-cn.com/problems/regular-expression-matching/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/010-%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/010-正则表达式匹配.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/010-regular-expression-matching.py)                      |                                            |

| 011 |		[盛最多水的容器](https://leetcode-cn.com/problems/container-with-most-water/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/011-%E7%9B%9B%E6%9C%80%E5%A4%9A%E6%B0%B4%E7%9A%84%E5%AE%B9%E5%99%A8.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/011-%E7%9B%9B%E6%9C%80%E5%A4%9A%E6%B0%B4%E7%9A%84%E5%AE%B9%E5%99%A8.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/011-container-with-most-water.py)                      |                                            |

| 012 |		[整数转罗马数字](https://leetcode-cn.com/problems/integer-to-roman/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/012-%E6%95%B4%E6%95%B0%E8%BD%AC%E7%BD%97%E9%A9%AC%E6%95%B0%E5%AD%97.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/012-%E6%95%B4%E6%95%B0%E8%BD%AC%E7%BD%97%E9%A9%AC%E6%95%B0%E5%AD%97.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/012-integer-to-roman.py)                      |                                            |

| 014 |		[最长公共前缀](https://leetcode-cn.com/problems/longest-common-prefix/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/014-%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%89%8D%E7%BC%80.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/014-%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%89%8D%E7%BC%80.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/014-longest-common-prefix.py)                      |                                            |

| 015 |		[三数之和](https://leetcode-cn.com/problems/3sum/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/015-%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/015-%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/015-3sum.py)                      |                                            |

| 016 |		[最接近的三数之和](https://leetcode-cn.com/problems/3sum-closest/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/016-%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/016-%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/016-3sum-closest.py)                      |                                            |

| 017 |		[电话号码的字母组合](https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/017-%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81%E7%9A%84%E5%AD%97%E6%AF%8D%E7%BB%84%E5%90%88.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/017-%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81%E7%9A%84%E5%AD%97%E6%AF%8D%E7%BB%84%E5%90%88.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/017-letter-combinations-of-a-phone-number.py)                      |                                            |

| 018 |		[四数之和](https://leetcode-cn.com/problems/4sum/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/018-%E5%9B%9B%E6%95%B0%E4%B9%8B%E5%92%8C.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/018-%E5%9B%9B%E6%95%B0%E4%B9%8B%E5%92%8C.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/018-4sum.py)                      |                                            |

| 019 |		[删除链表的倒数第N个节点](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/019-%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%ACN%E4%B8%AA%E8%8A%82%E7%82%B9.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/019-%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%ACN%E4%B8%AA%E8%8A%82%E7%82%B9.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/019-remove-nth-node-from-end-of-list.py)                      |                                            |

| 020 |		[有效的括号](https://leetcode-cn.com/problems/valid-parentheses/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/020-%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/020-%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/020-valid-parentheses.py)                      |                                            |

| 021 |		[合并两个有序链表](https://leetcode-cn.com/problems/merge-two-sorted-lists/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/021-%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/021-%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/021-merge-two-sorted-lists.py)                      |                                            |

| 022 |		[括号生成](https://leetcode-cn.com/problems/generate-parentheses/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/022-%E6%8B%AC%E5%8F%B7%E7%94%9F%E6%88%90.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/022-%E6%8B%AC%E5%8F%B7%E7%94%9F%E6%88%90.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/022-generate-parentheses.py)                      |                                            |

| 023 |		[合并K个排序链表](https://leetcode-cn.com/problems/merge-k-sorted-lists/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/023-%E5%90%88%E5%B9%B6K%E4%B8%AA%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/023-%E5%90%88%E5%B9%B6K%E4%B8%AA%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/023-merge-k-sorted-lists.py)                      |                                            |

| 024 |		 [两两交换链表中的节点](https://leetcode-cn.com/problems/swap-nodes-in-pairs/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/024-+%E4%B8%A4%E4%B8%A4%E4%BA%A4%E6%8D%A2%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.cpp)  |                      [Code](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/Java/024-%20%E4%B8%A4%E4%B8%A4%E4%BA%A4%E6%8D%A2%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/024-swap-nodes-in-pairs.py)                      |                                            |

| 026 |		[删除排序数组中的重复项](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/026-%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/026-%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/026-remove-duplicates-from-sorted-array.py)                      |                                            |

| 027 |		[移除元素](https://leetcode-cn.com/problems/remove-element/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/027-%E7%A7%BB%E9%99%A4%E5%85%83%E7%B4%A0.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/027-%E7%A7%BB%E9%99%A4%E5%85%83%E7%B4%A0.Java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/027-remove-element.py)                      |                                            |

| 030 |		[与所有单词相关联的字串](https://leetcode-cn.com/problems/substring-with-concatenation-of-all-words/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/030-%E4%B8%8E%E6%89%80%E6%9C%89%E5%8D%95%E8%AF%8D%E7%9B%B8%E5%85%B3%E8%81%94%E7%9A%84%E5%AD%97%E4%B8%B2.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/030-%E4%B8%8E%E6%89%80%E6%9C%89%E5%8D%95%E8%AF%8D%E7%9B%B8%E5%85%B3%E8%81%94%E7%9A%84%E5%AD%97%E4%B8%B2.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/030-substring-with-concatenation-of-all-words.py)                      |                                            |

| 031 |		[下一个排列](https://leetcode-cn.com/problems/next-permutation/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/031-%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%8E%92%E5%88%97.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/031-%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%8E%92%E5%88%97.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/031-next-permutation.py)                      |                                            |

| 032 |		[最长有效括号](https://leetcode-cn.com/problems/longest-valid-parentheses/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/032-%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/032-%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/032-longest-valid-parentheses.py)                      |                                            |

| 033 |		[搜索旋转排序数组](https://leetcode-cn.com/problems/search-in-rotated-sorted-array/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/033-%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/033-%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/033-search-in-rotated-sorted-array.py)                      |                                            |

| 034 |		[在排序数组中查找元素的第一个和最后一个位置](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/034-%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%92%8C%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E4%BD%8D%E7%BD%AE.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/034-%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%92%8C%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E4%BD%8D%E7%BD%AE.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/034-find-first-and-last-position-of-element-in-sorted-array.py)                      |                                            |

| 035 |		[搜索插入位置](https://leetcode-cn.com/problems/search-insert-position/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/035-%E6%90%9C%E7%B4%A2%E6%8F%92%E5%85%A5%E4%BD%8D%E7%BD%AE.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/035-%E6%90%9C%E7%B4%A2%E6%8F%92%E5%85%A5%E4%BD%8D%E7%BD%AE.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/035-search-insert-position.py)                      |                                            |

| 036 |		[有效的数独](https://leetcode-cn.com/problems/valid-sudoku/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/036-%E6%9C%89%E6%95%88%E7%9A%84%E6%95%B0%E7%8B%AC.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/036-%E6%9C%89%E6%95%88%E7%9A%84%E6%95%B0%E7%8B%AC.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/036-valid-sudoku.py)                      |                                            |

| 037 |		[解数独](https://leetcode-cn.com/problems/sudoku-solver/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/037-%E8%A7%A3%E6%95%B0%E7%8B%AC.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/037-%E8%A7%A3%E6%95%B0%E7%8B%AC.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/037-sudoku-solver.py)                      |                                            |

| 039 |		[组合总和](https://leetcode-cn.com/problems/combination-sum/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/039-%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/039-%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/039-combination-sum.py)                      |                                            |

| 040 |		[组合总和2](https://leetcode-cn.com/problems/combination-sum-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/040-%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C2.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/040-%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C2.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/040-combination-sum-ii.py)                      |                                            |

| 041 |		[缺失的第一个正数](https://leetcode-cn.com/problems/first-missing-positive/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/041-%E7%BC%BA%E5%A4%B1%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E6%AD%A3%E6%95%B0.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/041-%E7%BC%BA%E5%A4%B1%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E6%AD%A3%E6%95%B0.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/041-first-missing-positive.py)                      |                                            |

| 042 |		[接雨水](https://leetcode-cn.com/problems/trapping-rain-water/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/042-%E6%8E%A5%E9%9B%A8%E6%B0%B4.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/042-%E6%8E%A5%E9%9B%A8%E6%B0%B4.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/042-trapping-rain-water.py)                      |                                            |

| 043 |		[字符串相乘](https://leetcode-cn.com/problems/multiply-strings/)	| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/043-%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E4%B9%98.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/043-%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E4%B9%98.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/043-multiply-strings.py)                      |                                            |

| 044 |		[通配符匹配](https://leetcode-cn.com/problems/wildcard-matching/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/044-%E9%80%9A%E9%85%8D%E7%AC%A6%E5%8C%B9%E9%85%8D.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/044-%E9%80%9A%E9%85%8D%E7%AC%A6%E5%8C%B9%E9%85%8D.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/044-wildcard-matching.py)                      |                                            |

| 045 |		[跳跃游戏2](https://leetcode-cn.com/problems/jump-game-ii/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/045-%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F2.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/045-%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F2.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/045-jump-game-ii.py)                      |                                            |

| 046 |		[全排列](https://leetcode-cn.com/problems/permutations/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/046-%E5%85%A8%E6%8E%92%E5%88%97.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/046-%E5%85%A8%E6%8E%92%E5%88%97.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/046-permutations.py)                      |                                            |

| 047 |		[全排列2](https://leetcode-cn.com/problems/permutations-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/047-%E5%85%A8%E6%8E%92%E5%88%972.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/047-%E5%85%A8%E6%8E%92%E5%88%972.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/047-permutations-ii.py)                      |                                            |

| 048 |		[旋转图像](https://leetcode-cn.com/problems/rotate-image/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/048-%E6%97%8B%E8%BD%AC%E5%9B%BE%E5%83%8F.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/048-%E6%97%8B%E8%BD%AC%E5%9B%BE%E5%83%8F.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/048-rotate-image.py)                      |                                            |

| 049 |		[字母异位词分组](https://leetcode-cn.com/problems/group-anagrams/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/049-%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D%E5%88%86%E7%BB%84.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/049-%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D%E5%88%86%E7%BB%84.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/049-group-anagrams.py)                      |                                            |

| 050 |		[Pow(x,n)](https://leetcode-cn.com/problems/powx-n/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/050-Pow%28x%2Cn%29.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/050-Pow%28x%2Cn%29.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/050-powx-n.py)                      |                                            |

| 051 |		[N皇后](https://leetcode-cn.com/problems/n-queens/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/051-N%E7%9A%87%E5%90%8E.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/051-n-queens.py)                      |                                            |

| 052 |		[N皇后2](https://leetcode-cn.com/problems/n-queens-ii/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/052-N%E7%9A%87%E5%90%8E2.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/052-n-queens-ii.py)                      |                                            |

| 053 |		[最大子序和](https://leetcode-cn.com/problems/maximum-subarray/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/053-%E6%9C%80%E5%A4%A7%E5%AD%90%E5%BA%8F%E5%92%8C.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/053-%E6%9C%80%E5%A4%A7%E5%AD%90%E5%BA%8F%E5%92%8C.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/053-maximum-subarray.py)                      |                                            |

| 054 |		[螺旋矩阵](https://leetcode-cn.com/problems/spiral-matrix/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/054-%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/054-%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/054-spiral-matrix.py)                      |                                            |

| 055 |		[跳跃游戏](https://leetcode-cn.com/problems/jump-game/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/055-%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/055-%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/055-jump-game.py)                      |                                            |

| 056 |		[合并区间](https://leetcode-cn.com/problems/merge-intervals/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/056-%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/056-%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/056-merge-intervals.py)                      |                                            |

| 057 |		[插入区间](https://leetcode-cn.com/problems/insert-interval/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/057-%E6%8F%92%E5%85%A5%E5%8C%BA%E9%97%B4.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/057-%E6%8F%92%E5%85%A5%E5%8C%BA%E9%97%B4.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/057-insert-interval.py)                      |                                            |

| 058 |		[最后一个单词的长度](https://leetcode-cn.com/problems/length-of-last-word/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/058-%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E5%8D%95%E8%AF%8D%E7%9A%84%E9%95%BF%E5%BA%A6.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/058-%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E5%8D%95%E8%AF%8D%E7%9A%84%E9%95%BF%E5%BA%A6.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/058-length-of-last-word.py)                      |                                            |

| 059 |		[螺旋矩阵2](https://leetcode-cn.com/problems/spiral-matrix-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/059-%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B52.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/059-%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B52.java)                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/059-spiral-matrix-ii.py)                      |                                            |

| 060 |		[第k个排列](https://leetcode-cn.com/problems/permutation-sequence/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/060-%E7%AC%ACk%E4%B8%AA%E6%8E%92%E5%88%97.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/060-%E7%AC%ACk%E4%B8%AA%E6%8E%92%E5%88%97.java)                      |                      no                      |                                            |

| 061 |		[旋转链表](https://leetcode-cn.com/problems/rotate-list/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/061-%E6%97%8B%E8%BD%AC%E9%93%BE%E8%A1%A8.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/061-%E6%97%8B%E8%BD%AC%E9%93%BE%E8%A1%A8.java)                      |                      no                      |                                            |

| 062 |		[不同的路径](https://leetcode-cn.com/problems/unique-paths/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/062-%E4%B8%8D%E5%90%8C%E7%9A%84%E8%B7%AF%E5%BE%84.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/062-%E4%B8%8D%E5%90%8C%E7%9A%84%E8%B7%AF%E5%BE%84.java)                      |                      no                      |                                            |

| 063 |		[不同路径](https://leetcode-cn.com/problems/unique-paths-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/063-%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/063-%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84.java)                      |                      no                      |                                            |

| 064 |		[最小路径和](https://leetcode-cn.com/problems/minimum-path-sum/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/064-%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/064-%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C.java)                      |                      no                      |                                            |

| 065 |		[有效数字](https://leetcode-cn.com/problems/valid-number/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/065-%E6%9C%89%E6%95%88%E6%95%B0%E5%AD%97.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/065-%E6%9C%89%E6%95%88%E6%95%B0%E5%AD%97.java)                      |                      no                      |                                            |

| 066 |		[加一](https://leetcode-cn.com/problems/plus-one/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/066-%E5%8A%A0%E4%B8%80.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/066-%E5%8A%A0%E4%B8%80.java)                      |                      no                      |                                            |

| 067 |		[二进制求和](https://leetcode-cn.com/problems/add-binary/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/067-%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%B1%82%E5%92%8C.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/067-%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%B1%82%E5%92%8C.java)                      |                      no                      |                                            |

| 068 |		[文本左右对齐](https://leetcode-cn.com/problems/text-justification/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/068-%E6%96%87%E6%9C%AC%E5%B7%A6%E5%8F%B3%E5%AF%B9%E9%BD%90.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/068-%E6%96%87%E6%9C%AC%E5%B7%A6%E5%8F%B3%E5%AF%B9%E9%BD%90.java)                      |                      no                      |                                            |

| 070 |		[爬楼梯](https://leetcode-cn.com/problems/climbing-stairs/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/070-%E7%88%AC%E6%A5%BC%E6%A2%AF.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/070-%E7%88%AC%E6%A5%BC%E6%A2%AF.java)                      |                      no                      |                                            |

| 071 |		[简化路径](https://leetcode-cn.com/problems/simplify-path/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/071-%E7%AE%80%E5%8C%96%E8%B7%AF%E5%BE%84.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/071-%E7%AE%80%E5%8C%96%E8%B7%AF%E5%BE%84.java)                      |                      no                      |                                            |

| 072 |		[编辑距离](https://leetcode-cn.com/problems/edit-distance/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/072-%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/072-%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB.java)                      |                      no                      |                                            |

| 074 |		[搜索二维矩阵](https://leetcode-cn.com/problems/search-a-2d-matrix/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/074-%E6%90%9C%E7%B4%A2%E4%BA%8C%E7%BB%B4%E7%9F%A9%E9%98%B5.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/074-%E6%90%9C%E7%B4%A2%E4%BA%8C%E7%BB%B4%E7%9F%A9%E9%98%B5.java)                      |                      no                      |                                            |

| 075 |		[分类颜色](https://leetcode-cn.com/problems/sort-colors/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/075-%E5%88%86%E7%B1%BB%E9%A2%9C%E8%89%B2.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/075-%E5%88%86%E7%B1%BB%E9%A2%9C%E8%89%B2.java)                      |                      no                      |                                            |

| 076 |		[最小覆盖子串](https://leetcode-cn.com/problems/minimum-window-substring/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/076-%E6%9C%80%E5%B0%8F%E8%A6%86%E7%9B%96%E5%AD%90%E4%B8%B2.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/076-%E6%9C%80%E5%B0%8F%E8%A6%86%E7%9B%96%E5%AD%90%E4%B8%B2.java)                      |                      no                      |                                            |

| 077 |		[组合](https://leetcode-cn.com/problems/combinations/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/077-%E7%BB%84%E5%90%88.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/077-%E7%BB%84%E5%90%88.java)                      |                      no                      |                                            |

| 078 |		[子集](https://leetcode-cn.com/problems/subsets/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/078-%E5%AD%90%E9%9B%86.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/078-%E5%AD%90%E9%9B%86.java)                      |                      no                      |                                            |

| 079 |		[单词搜索](https://leetcode-cn.com/problems/word-search/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/079-%E5%8D%95%E8%AF%8D%E6%90%9C%E7%B4%A2.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/079-%E5%8D%95%E8%AF%8D%E6%90%9C%E7%B4%A2.java)                      |                      no                      |                                            |

| 080 |		[删除排序数组中的重复项2](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/080-%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9%202.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/080-%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9%202.java)                      |                      no                      |                                            |

| 082 |		[删除排序链表中的重复元素2](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/082-%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%202.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/082-%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%202.java)                      |                      no                      |                                            |

| 083 |		[删除排序链表中的重复元素](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/083-%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/083-%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.java)                      |                      no                      |                                            |

| 084 |		[柱状图中的最大矩形](https://leetcode-cn.com/problems/largest-rectangle-in-histogram/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/084-%E6%9F%B1%E7%8A%B6%E5%9B%BE%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E7%9F%A9%E5%BD%A2.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/084-%E6%9F%B1%E7%8A%B6%E5%9B%BE%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E7%9F%A9%E5%BD%A2.java)                      |                      no                      |                                            |

| 085 |		[最大矩形](https://leetcode-cn.com/problems/maximal-rectangle/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/085-%E6%9C%80%E5%A4%A7%E7%9F%A9%E5%BD%A2.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/085-%E6%9C%80%E5%A4%A7%E7%9F%A9%E5%BD%A2.java)                      |                      no                      |                                            |

| 086 |		[分隔链表](https://leetcode-cn.com/problems/partition-list/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/086-%E5%88%86%E9%9A%94%E9%93%BE%E8%A1%A8.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/086-%E5%88%86%E9%9A%94%E9%93%BE%E8%A1%A8.java)                      |                      no                      |                                            |

| 090 |		[子集2](https://leetcode-cn.com/problems/subsets-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/090-%E5%AD%90%E9%9B%86%202.cpp)  |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Java/090-%E5%AD%90%E9%9B%86%202.java)                      |                      no                      |                                            |

| 091 |		[解码方法](https://leetcode-cn.com/problems/decode-ways/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/091-%E8%A7%A3%E7%A0%81%E6%96%B9%E6%B3%95.cpp)  |                      no                      |                      no                      |                                            |

| 092 |		[反转链表2](https://leetcode-cn.com/problems/reverse-linked-list-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/092-%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8%202.cpp)  |                      no                      |                      no                      |                                            |

| 093 |		[复原IP地址](https://leetcode-cn.com/problems/restore-ip-addresses/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/093-%E5%A4%8D%E5%8E%9FIP%E5%9C%B0%E5%9D%80.cpp)  |                      no                      |                      no                      |                                            |

| 094 |		[二叉树的中序遍历](https://leetcode-cn.com/problems/binary-tree-inorder-traversal/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/094-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/094-binary-tree-inorder-traversal.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/094-binary-tree-inorder-traversal.go) |

| 095 |		[不同的二叉搜索树2](https://leetcode-cn.com/problems/unique-binary-search-trees-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/095-%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%202.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/095-unique-binary-search-trees-ii.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/095-unique-binary-search-trees-ii.go) |

| 096 |		[不同的搜索二叉树](https://leetcode-cn.com/problems/unique-binary-search-trees/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/096-%E4%B8%8D%E5%90%8C%E7%9A%84%E6%90%9C%E7%B4%A2%E4%BA%8C%E5%8F%89%E6%A0%91.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/096-unique-binary-search-trees.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/096-unique-binary-search-trees.go) |

| 097 |		[交错字符串](https://leetcode-cn.com/problems/interleaving-string/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/097-%E4%BA%A4%E9%94%99%E5%AD%97%E7%AC%A6%E4%B8%B2.cpp)  |                      no                      |                      no                      |                                            |

| 098 |		[验证二叉搜索树](https://leetcode-cn.com/problems/validate-binary-search-tree/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/098-%E9%AA%8C%E8%AF%81%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/098-validate-binary-search-tree.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/098-validate-binary-search-tree.go) |

| 099 |		[恢复二叉搜索树](https://leetcode-cn.com/problems/recover-binary-search-tree/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/099-%E6%81%A2%E5%A4%8D%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/099-recover-binary-search-tree.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/099-recover-binary-search-tree.go) |

| 100 |		[相同的树](https://leetcode-cn.com/problems/same-tree/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/100-%E7%9B%B8%E5%90%8C%E7%9A%84%E6%A0%91.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/100-same-tree.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/100-same-tree.go) |

| 101 |		[对称二叉树](https://leetcode-cn.com/problems/symmetric-tree/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/101-%E5%AF%B9%E7%A7%B0%E4%BA%8C%E5%8F%89%E6%A0%91.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/101-symmetric-tree.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/101-symmetric-tree.go) |

| 102 |		[二叉树的层次遍历](https://leetcode-cn.com/problems/binary-tree-level-order-traversal/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/102-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E6%AC%A1%E9%81%8D%E5%8E%86.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/102-binary-tree-level-order-traversal.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/102-binary-tree-level-order-traversal.go) |

| 103 |		[二叉树的锯齿层次遍历](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/103-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%94%AF%E9%BD%BF%E5%B1%82%E6%AC%A1%E9%81%8D%E5%8E%86.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/103-binary-tree-zigzag-level-order-traversal.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/103-binary-tree-zigzag-level-order-traversal.go) |

| 104 |		[二叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/104-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/104-maximum-depth-of-binary-tree.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/104-maximum-depth-of-binary-tree.go) |

| 105 |		[前序中序构造二叉树](https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/105-%E5%89%8D%E5%BA%8F%E4%B8%AD%E5%BA%8F%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/105-construct-binary-tree-from-preorder-and-inorder-traversal.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/105-construct-binary-tree-from-preorder-and-inorder-traversal.go) |

| 106 |		[中序后序构造二叉树](https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/106-%E4%B8%AD%E5%BA%8F%E5%90%8E%E5%BA%8F%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/106-construct-binary-tree-from-inorder-and-postorder-traversal.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/106-construct-binary-tree-from-inorder-and-postorder-traversal.go) |

| 107 |		[二叉树的层次遍历2](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/107-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E6%AC%A1%E9%81%8D%E5%8E%862.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/107-binary-tree-level-order-traversal-ii.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/107-binary-tree-level-order-traversal-ii.go) |

| 108 |		[将有序数组转换为二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/108-%E5%B0%86%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/108-convert-sorted-array-to-binary-search-tree.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/108-convert-sorted-array-to-binary-search-tree.go) |

| 109 |		[有序链表转换二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-list-to-binary-search-tree/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/109-%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8%E8%BD%AC%E6%8D%A2%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/109-convert-sorted-list-to-binary-search-tree.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/109-convert-sorted-list-to-binary-search-tree.go) |

| 110 |		[平衡二叉树](https://leetcode-cn.com/problems/balanced-binary-tree/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/110-%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/110-balanced-binary-tree.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/110-balanced-binary-tree.go) |

| 111 |		[二叉树的最小深度](https://leetcode-cn.com/problems/balanced-binary-tree/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/111-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/111-minimum-depth-of-binary-tree.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/111-minimum-depth-of-binary-tree.go) |

| 112 |		[路径总和](https://leetcode-cn.com/problems/path-sum/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/112-%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/112-path-sum.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/112-path-sum.go) |

| 113 |		[路径总和2](https://leetcode-cn.com/problems/path-sum-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/113-%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C2.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/113-path-sum-ii.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/113-path-sum-ii.go) |

| 114 |		[二叉树展开为链表](https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-list/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/114-%E4%BA%8C%E5%8F%89%E6%A0%91%E5%B1%95%E5%BC%80%E4%B8%BA%E9%93%BE%E8%A1%A8.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/114-flatten-binary-tree-to-linked-list.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/114-flatten-binary-tree-to-linked-list.go) |

| 115 |		[不同的子序列](https://leetcode-cn.com/problems/distinct-subsequences/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/115-%E4%B8%8D%E5%90%8C%E7%9A%84%E5%AD%90%E5%BA%8F%E5%88%97.cpp)  |                      no                      |                      no                      |                                            |

| 116 |		[填充同一层的兄弟节点](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/116-%E5%A1%AB%E5%85%85%E5%90%8C%E4%B8%80%E5%B1%82%E7%9A%84%E5%85%84%E5%BC%9F%E8%8A%82%E7%82%B9.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/116-populating-next-right-pointers-in-each-node.py)                      | 没有解题选项 |

| 117 |		[填充同一层的兄弟节点2](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/117-%E5%A1%AB%E5%85%85%E5%90%8C%E4%B8%80%E5%B1%82%E7%9A%84%E5%85%84%E5%BC%9F%E8%8A%82%E7%82%B9%202.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/117-populating-next-right-pointers-in-each-node-ii.py)                      | 没有解题选项 |

| 118 |		[杨辉三角形](https://leetcode-cn.com/problems/pascals-triangle/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/118-%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92%E5%BD%A2.cpp)  |                      no                      |                      no                      |                                            |

| 119 |		[杨辉三角形2](https://leetcode-cn.com/problems/pascals-triangle-ii/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/119-%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92%E5%BD%A22.cpp)  |                      no                      |                      no                      |                                            |

| 120 |		[三角形最短路径和](https://leetcode-cn.com/problems/triangle/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/120-%E4%B8%89%E8%A7%92%E5%BD%A2%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E5%92%8C.cpp)  |                      no                      |                      no                      |                                            |

| 121 |		[买卖股票的最佳时机](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/121-%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA.cpp)  |                      no                      |                      no                      |                                            |

| 122 |		[买卖股票的最佳时机2](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/122-%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%202.cpp)  |                      no                      |                      no                      |                                            |

| 123 |		[买卖股票的最佳时机3](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/123-%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%203.cpp)  |                      no                      |                      no                      |                                            |

| 124 |		[二叉树中的最大路径和](https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/124-%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/124-binary-tree-maximum-path-sum.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/124-binary-tree-maximum-path-sum.go) |

| 127 |		[单词接龙](https://leetcode-cn.com/problems/word-ladder/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/127-%E5%8D%95%E8%AF%8D%E6%8E%A5%E9%BE%99.cpp)  |                      no                      |                      no                      |                                            |

| 128 |		[最长连续序列](https://leetcode-cn.com/problems/longest-consecutive-sequence/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/128-%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.cpp)  |                      no                      |                      no                      |                                            |

| 129 |		[求根到叶子节点数字之和](https://leetcode-cn.com/problems/sum-root-to-leaf-numbers/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/129-%E6%B1%82%E6%A0%B9%E5%88%B0%E5%8F%B6%E5%AD%90%E8%8A%82%E7%82%B9%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/129-sum-root-to-leaf-numbers.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/129-sum-root-to-leaf-numbers.go) |

| 131 |		[分割回文串](https://leetcode-cn.com/problems/palindrome-partitioning/)	| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/131-%E5%88%86%E5%89%B2%E5%9B%9E%E6%96%87%E4%B8%B2.cpp)  |                      no                      |                      no                      |                                            |

| 132 |		[分割回文串2](https://leetcode-cn.com/problems/palindrome-partitioning-ii/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/132-%E5%88%86%E5%89%B2%E5%9B%9E%E6%96%87%E4%B8%B2%202.cpp)  |                      no                      |                      no                      |                                            |

| 133 |		[克隆图](https://leetcode-cn.com/problems/clone-graph/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/133-%E5%85%8B%E9%9A%86%E5%9B%BE.cpp)  |                      no                      |                      no                      |                                            |

| 134 |		[加油站](https://leetcode-cn.com/problems/gas-station/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/134-%E5%8A%A0%E6%B2%B9%E7%AB%99.cpp)  |                      no                      |                      no                      |                                            |

| 135 |		[分发糖果](https://leetcode-cn.com/problems/candy/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/135-%E5%88%86%E5%8F%91%E7%B3%96%E6%9E%9C.cpp)  |                      no                      |                      no                      |                                            |

| 139 |		[单词拆分](https://leetcode-cn.com/problems/word-break/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/139-%E5%8D%95%E8%AF%8D%E6%8B%86%E5%88%86.cpp)  |                      no                      |                      no                      |                                            |

| 140 |		[单词拆分2](https://leetcode-cn.com/problems/word-break-ii/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/140-%E5%8D%95%E8%AF%8D%E6%8B%86%E5%88%86%202.cpp)  |                      no                      |                      no                      |                                            |

| 141 |		[环形链表](https://leetcode-cn.com/problems/linked-list-cycle/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/141-%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8.cpp)  |                      no                      |                      no                      |                                            |

| 142 |		[环形链表2](https://leetcode-cn.com/problems/linked-list-cycle-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/142-%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8%202.cpp)  |                      no                      |                      no                      |                                            |

| 144 |		[二叉树的前序遍历](https://leetcode-cn.com/problems/binary-tree-preorder-traversal/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/144-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/144-binary-tree-preorder-traversal.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/144-binary-tree-preorder-traversal.go) |

| 145 |		[二叉树的后序遍历](https://leetcode-cn.com/problems/binary-tree-postorder-traversal/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/145-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/145-binary-tree-postorder-traversal.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/145-binary-tree-postorder-traversal.go) |

| 146 |		[LRU缓存机制](https://leetcode-cn.com/problems/lru-cache/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/146-LRU%E7%BC%93%E5%AD%98%E6%9C%BA%E5%88%B6.cpp)  |                      no                      |                      no                      |                                            |

| 147 |		[对链表进行插入排序](https://leetcode-cn.com/problems/insertion-sort-list/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/147-%E5%AF%B9%E9%93%BE%E8%A1%A8%E8%BF%9B%E8%A1%8C%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F.cpp)  |                      no                      |                      no                      |                                            |

| 148 |		[排序链表](https://leetcode-cn.com/problems/sort-list/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/148-%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8.cpp)  |                      no                      |                      no                      |                                            |

| 150 |		[逆波兰符求值](https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/150-%E9%80%86%E6%B3%A2%E5%85%B0%E7%AC%A6%E6%B1%82%E5%80%BC.cpp)  |                      no                      |                      no                      |                                            |

| 152 |		[最大乘积子序列](https://leetcode-cn.com/problems/maximum-product-subarray/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/152-%E6%9C%80%E5%A4%A7%E4%B9%98%E7%A7%AF%E5%AD%90%E5%BA%8F%E5%88%97.cpp)  |                      no                      |                      no                      |                                            |

| 160 |		[相交链表](https://leetcode-cn.com/problems/intersection-of-two-linked-lists/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/160-%E7%9B%B8%E4%BA%A4%E9%93%BE%E8%A1%A8.cpp)  |                      no                      |                      no                      |                                            |

| 162 |		[寻找峰值](https://leetcode-cn.com/problems/find-peak-element/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/162-%E5%AF%BB%E6%89%BE%E5%B3%B0%E5%80%BC.cpp)  |                      no                      |                      no                      |                                            |

| 164 |		[最大间距](https://leetcode-cn.com/problems/maximum-gap/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/164-%E6%9C%80%E5%A4%A7%E9%97%B4%E8%B7%9D.cpp)  |                      no                      |                      no                      |                                            |

| 165 |		[比较版本号](https://leetcode-cn.com/problems/compare-version-numbers/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/165-%E6%AF%94%E8%BE%83%E7%89%88%E6%9C%AC%E5%8F%B7.cpp)  |                      no                      |                      no                      |                                            |

| 168 |		[Excel表列名称](https://leetcode-cn.com/problems/excel-sheet-column-title/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/168-Excel%E8%A1%A8%E5%88%97%E5%90%8D%E7%A7%B0.cpp)  |                      no                      |                      no                      |                                            |

| 169 |		[求众数](https://leetcode-cn.com/problems/majority-element/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/169-%E6%B1%82%E4%BC%97%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 172 |		[阶乘后的零](https://leetcode-cn.com/problems/factorial-trailing-zeroes/)	| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/172-%E9%98%B6%E4%B9%98%E5%90%8E%E7%9A%84%E9%9B%B6.cpp)  |                      no                      |                      no                      |                                            |

| 173 |		[二叉搜索树迭代器](https://leetcode-cn.com/problems/binary-search-tree-iterator/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/173-%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BF%AD%E4%BB%A3%E5%99%A8.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/173-binary-search-tree-iterator.py)                      | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/173-binary-search-tree-iterator.go) |

| 174 |		[地下城游戏](https://leetcode-cn.com/problems/dungeon-game/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/174-%E5%9C%B0%E4%B8%8B%E5%9F%8E%E6%B8%B8%E6%88%8F.cpp)  |                      no                      |                      no                      |                                            |

| 179 |		[最大数](https://leetcode-cn.com/problems/largest-number/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/179-%E6%9C%80%E5%A4%A7%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 188 |		 [买卖股票的最佳时机IV](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/188-%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%20IV.cpp)  |                      no                      |                      no                      |                                            |

| 198 |		[打家劫舍](https://leetcode-cn.com/problems/house-robber/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/198-%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D.cpp)  |                      no                      |                      no                      |                                            |

| 199 |		[二叉树的右视图](https://leetcode-cn.com/problems/binary-tree-right-side-view/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/199-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/199-binary-tree-right-side-view.py)                      |                                            |

| 200 |		[岛屿的个数](https://leetcode-cn.com/problems/number-of-islands/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/200-%E5%B2%9B%E5%B1%BF%E7%9A%84%E4%B8%AA%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 203 |		[删除链表中的节点](https://leetcode-cn.com/problems/remove-linked-list-elements/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/203-%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.cpp)  |                      no                      |                      no                      |                                            |

| 206 |		[反转链表](https://leetcode-cn.com/problems/reverse-linked-list/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/206-%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.cpp)  |                      no                      |                      no                      |                                            |

| 207 |		[课程表](https://leetcode-cn.com/problems/course-schedule/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/207-%E8%AF%BE%E7%A8%8B%E8%A1%A8.cpp)  |                      no                      |                      no                      |                                            |

| 208 |		[实现Trie(前缀树)](https://leetcode-cn.com/problems/implement-trie-prefix-tree/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/208-%E5%AE%9E%E7%8E%B0%20Trie%20(%E5%89%8D%E7%BC%80%E6%A0%91).cpp)  |                      no                      |                      no                      |                                            |

| 209 |		[长度最小的子数组](https://leetcode-cn.com/problems/minimum-size-subarray-sum/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/209-%E9%95%BF%E5%BA%A6%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.cpp)  |                      no                      |                      no                      |                                            |

| 210 |		[课程表2](https://leetcode-cn.com/problems/course-schedule-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/210-%E8%AF%BE%E7%A8%8B%E8%A1%A8%202.cpp)  |                      no                      |                      no                      |                                            |

| 211 |		[添加与搜索单词-数据结构设计](https://leetcode-cn.com/problems/add-and-search-word-data-structure-design/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/211-%E6%B7%BB%E5%8A%A0%E4%B8%8E%E6%90%9C%E7%B4%A2%E5%8D%95%E8%AF%8D%20-%20%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E8%AE%BE%E8%AE%A1.cpp)  |                      no                      |                      no                      |                                            |

| 212 |		[单词搜索2](https://leetcode-cn.com/problems/word-search-ii/)	| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/212-%E5%8D%95%E8%AF%8D%E6%90%9C%E7%B4%A2%202.cpp)  |                      no                      |                      no                      |                                            |

| 213 |		[打家劫舍2](https://leetcode-cn.com/problems/house-robber-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/213-%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D%202.cpp)  |                      no                      |                      no                      |                                            |

| 214 |		[最短回文串](https://leetcode-cn.com/problems/shortest-palindrome/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/214-%E6%9C%80%E7%9F%AD%E5%9B%9E%E6%96%87%E4%B8%B2.cpp)  |                      no                      |                      no                      |                                            |

| 215 |		[数组中第k大个元素](https://leetcode-cn.com/problems/kth-largest-element-in-an-array/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/215-%E6%95%B0%E7%BB%84%E4%B8%AD%E7%AC%ACk%E5%A4%A7%E4%B8%AA%E5%85%83%E7%B4%A0.cpp)  |                      no                      |                      no                      |                                            |

| 216 |		[组合总和3](https://leetcode-cn.com/problems/combination-sum-iii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/216-%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C%203.cpp)  |                      no                      |                      no                      |                                            |

| 218 |		[天际线问题](https://leetcode-cn.com/problems/the-skyline-problem/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/218-%E5%A4%A9%E9%99%85%E7%BA%BF%E9%97%AE%E9%A2%98.cpp)  |                      no                      |                      no                      |                                            |

| 221 |		[最大正方形](https://leetcode-cn.com/problems/maximal-square/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/221-%E6%9C%80%E5%A4%A7%E6%AD%A3%E6%96%B9%E5%BD%A2.cpp)  |                      no                      |                      no                      |                                            |

| 222 |		[完全二叉树的节点个数](https://leetcode-cn.com/problems/count-complete-tree-nodes/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/222-%E5%AE%8C%E5%85%A8%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E8%8A%82%E7%82%B9%E4%B8%AA%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 223 |		[矩形面积](https://leetcode-cn.com/problems/rectangle-area/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/223-%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF.cpp)  |                      no                      |                      no                      |                                            |

| 226 |		[翻转二叉树](https://leetcode-cn.com/problems/invert-binary-tree/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/226-%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.cpp)  |                      no                      |                      no                      |                                            |

| 228 |		[汇总区间](https://leetcode-cn.com/problems/summary-ranges/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/228-%E6%B1%87%E6%80%BB%E5%8C%BA%E9%97%B4.cpp)  |                      no                      |                      no                      |                                            |

| 229 |		[求众数2](https://leetcode-cn.com/problems/majority-element-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/229-%E6%B1%82%E4%BC%97%E6%95%B0%202.cpp)  |                      no                      |                      no                      |                                            |

| 230 |		[二叉搜索树中第K小的元素](https://leetcode-cn.com/problems/kth-smallest-element-in-a-bst/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/230-%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%AC%ACK%E5%B0%8F%E7%9A%84%E5%85%83%E7%B4%A0.cpp)  |                      no                      |                      no                      |                                            |

| 234 |		[回文链表](https://leetcode-cn.com/problems/palindrome-linked-list/)		| Easy |[Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/234-%E5%9B%9E%E6%96%87%E9%93%BE%E8%A1%A8.cpp)  |                      no                      |                      no                      |                                            |

| 235 |		[二叉搜索树的最近公共祖先](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/235-%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.cpp)  |                      no                      |                      no                      |                                            |

| 236 |		[二叉树的最近公共祖先](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/236-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.cpp)  |                      no                      |                      no                      |                                            |

| 237 |		[删除二叉树中的节点](https://leetcode-cn.com/problems/delete-node-in-a-linked-list/)		| Easy | [Code](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/C%2B%2B%E7%89%88/237-%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.cpp)  |                      no                      |                      no                      |                                            |

| 238 |		[除自身以外数组的乘积](https://leetcode-cn.com/problems/product-of-array-except-self/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/238-%E9%99%A4%E8%87%AA%E8%BA%AB%E4%BB%A5%E5%A4%96%E6%95%B0%E7%BB%84%E7%9A%84%E4%B9%98%E7%A7%AF.cpp)  |                      no                      |                      no                      |                                            |

| 239 |		[滑动窗口最大值](https://leetcode-cn.com/problems/sliding-window-maximum/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/239-%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%9C%80%E5%A4%A7%E5%80%BC.cpp)  |                      no                      |                      no                      |                                            |

| 240 |		[搜索二维矩阵2](https://leetcode-cn.com/problems/search-a-2d-matrix-ii/)	| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/240-%E6%90%9C%E7%B4%A2%E4%BA%8C%E7%BB%B4%E7%9F%A9%E9%98%B52.cpp)  |                      no                      |                      no                      |                                            |

| 241 |		[为运算表达式设计优先级](https://leetcode-cn.com/problems/different-ways-to-add-parentheses/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/241-%E4%B8%BA%E8%BF%90%E7%AE%97%E8%A1%A8%E8%BE%BE%E5%BC%8F%E8%AE%BE%E8%AE%A1%E4%BC%98%E5%85%88%E7%BA%A7.cpp)  |                      no                      |                      no                      |                                            |

| 257 |		[二叉树的所有路径](https://leetcode-cn.com/problems/binary-tree-paths/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/257-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%89%80%E6%9C%89%E8%B7%AF%E5%BE%84.cpp)  |                      no                      |                      no                      |                                            |

| 264 |		[丑数2](https://leetcode-cn.com/problems/ugly-number-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/264-%E4%B8%91%E6%95%B02.cpp)  |                      no                      |                      no                      |                                            |

| 274 |		[H指数](https://leetcode-cn.com/problems/h-index/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/274-H%E6%8C%87%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 279 |		[完全平方数](https://leetcode-cn.com/problems/perfect-squares/)	| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/279-%E5%AE%8C%E5%85%A8%E5%B9%B3%E6%96%B9%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 282 |		[给表达式添加运算符](https://leetcode-cn.com/problems/expression-add-operators/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/282-%E7%BB%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E6%B7%BB%E5%8A%A0%E8%BF%90%E7%AE%97%E7%AC%A6.cpp)  |                      no                      |                      no                      |                                            |

| 284 |		[顶端迭代器](https://leetcode-cn.com/problems/peeking-iterator/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/284-%E9%A1%B6%E7%AB%AF%E8%BF%AD%E4%BB%A3%E5%99%A8.cpp)  |                      no                      |                      no                      |                                            |

| 287 |		[寻找重复数](https://leetcode-cn.com/problems/find-the-duplicate-number/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/287-%E5%AF%BB%E6%89%BE%E9%87%8D%E5%A4%8D%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 289 |		[生命游戏](https://leetcode-cn.com/problems/game-of-life/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/289-%E7%94%9F%E5%91%BD%E6%B8%B8%E6%88%8F.cpp)  |                      no                      |                      no                      |                                            |

| 295 |		[数据流的中位数](https://leetcode-cn.com/problems/find-median-from-data-stream/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/295-%E6%95%B0%E6%8D%AE%E6%B5%81%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 297 |		[二叉树的序列化与反序列化](https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/297-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%BA%8F%E5%88%97%E5%8C%96%E4%B8%8E%E5%8F%8D%E5%BA%8F%E5%88%97%E5%8C%96.cpp)  |                      no                      |                      [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/297-serialize-and-deserialize-binary-tree.py)                      | 没有解题选项 |

| 299 |		[猜数字游戏](https://leetcode-cn.com/problems/bulls-and-cows/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/299-%E7%8C%9C%E6%95%B0%E5%AD%97%E6%B8%B8%E6%88%8F.cpp)  |                      no                      |                      no                      |                                            |

| 300 |		[最长上升子序列](https://leetcode-cn.com/problems/longest-increasing-subsequence/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/300-%E6%9C%80%E9%95%BF%E4%B8%8A%E5%8D%87%E5%AD%90%E5%BA%8F%E5%88%97.cpp)  |                      no                      |                      no                      |                                            |

| 301 |		[删除无效的括号](https://leetcode-cn.com/problems/remove-invalid-parentheses/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/301-%E5%88%A0%E9%99%A4%E6%97%A0%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.cpp)  |                      no                      |                      no                      |                                            |

| 303 |		[区域和检索-数组不可变](https://leetcode-cn.com/problems/range-sum-query-immutable/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/303-%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E6%95%B0%E7%BB%84%E4%B8%8D%E5%8F%AF%E5%8F%98.cpp)  |                      no                      |                      no                      |                                            |

| 304 |		[二维区域和检索-矩阵不可变](https://leetcode-cn.com/problems/range-sum-query-2d-immutable/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/304-%E4%BA%8C%E7%BB%B4%E5%8C%BA%E5%9F%9F%E5%92%8C%E6%A3%80%E7%B4%A2%20-%20%E7%9F%A9%E9%98%B5%E4%B8%8D%E5%8F%AF%E5%8F%98.cpp)  |                      no                      |                      no                      |                                            |

| 309 |		[最佳买卖股票时机含冷冻期](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/309-%E6%9C%80%E4%BD%B3%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E6%97%B6%E6%9C%BA%E5%90%AB%E5%86%B7%E5%86%BB%E6%9C%9F.cpp)  |                      no                      |                      no                      |                                            |

| 310 |		[最小高度树](https://leetcode-cn.com/problems/minimum-height-trees/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/310-%E6%9C%80%E5%B0%8F%E9%AB%98%E5%BA%A6%E6%A0%91.cpp)  |                      no                      |                      no                      |                                            |

| 312 |		[戳气球](https://leetcode-cn.com/problems/burst-balloons/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/312-%E6%88%B3%E6%B0%94%E7%90%83.cpp)  |                      no                      |                      no                      |                                            |

| 315 |		[计算右侧小于当前元素的个数](https://leetcode-cn.com/problems/count-of-smaller-numbers-after-self/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/315-%E8%AE%A1%E7%AE%97%E5%8F%B3%E4%BE%A7%E5%B0%8F%E4%BA%8E%E5%BD%93%E5%89%8D%E5%85%83%E7%B4%A0%E7%9A%84%E4%B8%AA%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 316 |		[去除重复字母](https://leetcode-cn.com/problems/remove-duplicate-letters/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/316-%E5%8E%BB%E9%99%A4%E9%87%8D%E5%A4%8D%E5%AD%97%E6%AF%8D.cpp)  |                      no                      |                      no                      |                                            |

| 319 |		[灯泡开关](https://leetcode-cn.com/problems/bulb-switcher/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/319-%E7%81%AF%E6%B3%A1%E5%BC%80%E5%85%B3.cpp)  |                      no                      |                      no                      |                                            |

| 321 |		[拼接最大数](https://leetcode-cn.com/problems/create-maximum-number/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/321-%E6%8B%BC%E6%8E%A5%E6%9C%80%E5%A4%A7%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 322 |		[零钱兑换](https://leetcode-cn.com/problems/coin-change/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/322-%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2.cpp)  |                      no                      |                      no                      |                                            |

| 326 |		[3的幂](https://leetcode-cn.com/problems/power-of-three/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/326-3%E7%9A%84%E5%B9%82.cpp)  |                      no                      |                      no                      |                                            |

| 328 |		[奇偶链表](https://leetcode-cn.com/problems/odd-even-linked-list/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/328-%E5%A5%87%E5%81%B6%E9%93%BE%E8%A1%A8.cpp)  |                      no                      |                      no                      |                                            |

| 329 |		[矩阵中的最长递增路径](https://leetcode-cn.com/problems/longest-increasing-path-in-a-matrix/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/329-%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E8%B7%AF%E5%BE%84.cpp)  |                      no                      |                      no                      |                                            |

| 331 |		[验证二叉树的前序序列化](https://leetcode-cn.com/problems/verify-preorder-serialization-of-a-binary-tree/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/331-%E9%AA%8C%E8%AF%81%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E5%BA%8F%E5%88%97%E5%8C%96.cpp)  |                      no                      |                      no                      |                                            |

| 332 |		[重新安排行程](https://leetcode-cn.com/problems/reconstruct-itinerary/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/332-%E9%87%8D%E6%96%B0%E5%AE%89%E6%8E%92%E8%A1%8C%E7%A8%8B.cpp)  |                      no                      |                      no                      |                                            |

| 334 |		[递增的三元子序列](https://leetcode-cn.com/problems/increasing-triplet-subsequence/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/334-%E9%80%92%E5%A2%9E%E7%9A%84%E4%B8%89%E5%85%83%E5%AD%90%E5%BA%8F%E5%88%97.cpp)  |                      no                      |                      no                      |                                            |

| 336 |		[回文对](https://leetcode-cn.com/problems/palindrome-pairs/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/336-%E5%9B%9E%E6%96%87%E5%AF%B9.cpp)  |                      no                      |                      no                      |                                            |

| 337 |		[打家劫舍3](https://leetcode-cn.com/problems/house-robber-iii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/337-%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D%203.cpp)  |                      no                      |                      no                      |                                            |

| 341 |		[扁平化嵌套列表迭代器](https://leetcode-cn.com/problems/flatten-nested-list-iterator/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/341-%E6%89%81%E5%B9%B3%E5%8C%96%E5%B5%8C%E5%A5%97%E5%88%97%E8%A1%A8%E8%BF%AD%E4%BB%A3%E5%99%A8.cpp)  |                      no                      |                      no                      |                                            |

| 343 |		[整数拆分](https://leetcode-cn.com/problems/integer-break/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/343-%E6%95%B4%E6%95%B0%E6%8B%86%E5%88%86.cpp)  |                      no                      |                      no                      |                                            |

| 344 |		[反转字符串](https://leetcode-cn.com/problems/reverse-string/)		| Medium | [Code](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/C%2B%2B%E7%89%88/344-%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.cpp)  |                      no                      |                      no                      |                                            |

| 347 |		[前K个高频元素](https://leetcode-cn.com/problems/top-k-frequent-elements/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/347-%E5%89%8DK%E4%B8%AA%E9%AB%98%E9%A2%91%E5%85%83%E7%B4%A0.cpp)  |                      no                      |                      no                      |                                            |

| 354 |		[俄罗斯套娃信封问题](https://leetcode-cn.com/problems/russian-doll-envelopes/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/354-%E4%BF%84%E7%BD%97%E6%96%AF%E5%A5%97%E5%A8%83%E4%BF%A1%E5%B0%81%E9%97%AE%E9%A2%98.cpp)  |                      no                      |                      no                      |                                            |

| 357 |		[计算各个位数不同的数字个数](https://leetcode-cn.com/problems/count-numbers-with-unique-digits/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/357-%E8%AE%A1%E7%AE%97%E5%90%84%E4%B8%AA%E4%BD%8D%E6%95%B0%E4%B8%8D%E5%90%8C%E7%9A%84%E6%95%B0%E5%AD%97%E4%B8%AA%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 365 |		[水壶问题](https://leetcode-cn.com/problems/water-and-jug-problem/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/365-%E6%B0%B4%E5%A3%B6%E9%97%AE%E9%A2%98.cpp)  |                      no                      |                      no                      |                                            |

| 368 |		[最大整除子集](https://leetcode-cn.com/problems/largest-divisible-subset/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/368-%E6%9C%80%E5%A4%A7%E6%95%B4%E9%99%A4%E5%AD%90%E9%9B%86.cpp)  |                      no                      |                      no                      |                                            |

| 373 |		[查找和最小的K对数字](https://leetcode-cn.com/problems/find-k-pairs-with-smallest-sums/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/373-%E6%9F%A5%E6%89%BE%E5%92%8C%E6%9C%80%E5%B0%8F%E7%9A%84K%E5%AF%B9%E6%95%B0%E5%AD%97.cpp)  |                      no                      |                      no                      |                                            |

| 376 |		[摆动序列](https://leetcode-cn.com/problems/wiggle-subsequence/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/376-%E6%91%86%E5%8A%A8%E5%BA%8F%E5%88%97.cpp)  |                      no                      |                      no                      |                                            |

| 377 |		[组合总和Ⅳ](https://leetcode-cn.com/problems/combination-sum-iv/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/377-%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C%20%E2%85%A3.cpp)  |                      no                      |                      no                      |                                            |

| 378 |		[有序矩阵中第K小的元素](https://leetcode-cn.com/problems/kth-smallest-element-in-a-sorted-matrix/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/378-%E6%9C%89%E5%BA%8F%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%AC%ACK%E5%B0%8F%E7%9A%84%E5%85%83%E7%B4%A0.cpp)  |                      no                      |                      no                      |                                            |

| 380 |		[常数时间插入、删除和获取随机元素](https://leetcode-cn.com/problems/insert-delete-getrandom-o1/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/380-%E5%B8%B8%E6%95%B0%E6%97%B6%E9%97%B4%E6%8F%92%E5%85%A5%E3%80%81%E5%88%A0%E9%99%A4%E5%92%8C%E8%8E%B7%E5%8F%96%E9%9A%8F%E6%9C%BA%E5%85%83%E7%B4%A0.cpp)  |                      no                      |                      no                      |                                            |

| 381 |		[O(1)时间插入、删除和获取随机元素-允许重复](https://leetcode-cn.com/problems/insert-delete-getrandom-o1-duplicates-allowed/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/381-O(1)%20%E6%97%B6%E9%97%B4%E6%8F%92%E5%85%A5%E3%80%81%E5%88%A0%E9%99%A4%E5%92%8C%E8%8E%B7%E5%8F%96%E9%9A%8F%E6%9C%BA%E5%85%83%E7%B4%A0%20-%20%E5%85%81%E8%AE%B8%E9%87%8D%E5%A4%8D.cpp)  |                      no                      |                      no                      |                                            |

| 387 |		[字符串中的第一个唯一字符](https://leetcode-cn.com/problems/first-unique-character-in-a-string/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/387-%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%94%AF%E4%B8%80%E5%AD%97%E7%AC%A6.cpp)  |                      no                      |                      no                      |                                            |

| 394 |		[字符串解码](https://leetcode-cn.com/problems/decode-string/)	| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/394-%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%A7%A3%E7%A0%81.cpp)  |                      no                      |                      no                      |                                            |

| 395 |		[至少有K个重复字符的最长子串](https://leetcode-cn.com/problems/longest-substring-with-at-least-k-repeating-characters/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/395-%E8%87%B3%E5%B0%91%E6%9C%89K%E4%B8%AA%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.cpp)  |                      no                      |                      no                      |                                            |

| 396 |		[旋转函数](https://leetcode-cn.com/problems/rotate-function/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/396-%E6%97%8B%E8%BD%AC%E5%87%BD%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 402 |		[移掉K位数字](https://leetcode-cn.com/problems/remove-k-digits/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/402-%E7%A7%BB%E6%8E%89K%E4%BD%8D%E6%95%B0%E5%AD%97.cpp)  |                      no                      |                      no                      |                                            |

| 403 |		[青蛙过河](https://leetcode-cn.com/problems/frog-jump/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/403-%E9%9D%92%E8%9B%99%E8%BF%87%E6%B2%B3.cpp)  |                      no                      |                      no                      |                                            |

| 404 |		[左叶子之和](https://leetcode-cn.com/problems/sum-of-left-leaves/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/404-%E5%B7%A6%E5%8F%B6%E5%AD%90%E4%B9%8B%E5%92%8C.cpp)  |                      no                      |                      no                      |                                            |

| 406 |		[根据身高重建队列](https://leetcode-cn.com/problems/queue-reconstruction-by-height/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/406-%E6%A0%B9%E6%8D%AE%E8%BA%AB%E9%AB%98%E9%87%8D%E5%BB%BA%E9%98%9F%E5%88%97.cpp)  |                      no                      |                      no                      |                                            |

| 409 |		[最长回文串](https://leetcode-cn.com/problems/longest-palindrome/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/409-%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E4%B8%B2.cpp)  |                      no                      |                      no                      |                                            |

| 413 |		[等差数列划分](https://leetcode-cn.com/problems/arithmetic-slices/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/413-%E7%AD%89%E5%B7%AE%E6%95%B0%E5%88%97%E5%88%92%E5%88%86.cpp)  |                      no                      |                      no                      |                                            |

| 416 |		[分割等和子集](https://leetcode-cn.com/problems/partition-equal-subset-sum/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/416-%E5%88%86%E5%89%B2%E7%AD%89%E5%92%8C%E5%AD%90%E9%9B%86.cpp)  |                      no                      |                      no                      |                                            |

| 424 |		[替换后的最长重复字符](https://leetcode-cn.com/problems/longest-repeating-character-replacement/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/424-%E6%9B%BF%E6%8D%A2%E5%90%8E%E7%9A%84%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6.cpp)  |                      no                      |                      no                      |                                            |

| 429 |		[N叉树的层序遍历](https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/429-N%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.cpp)  |                      no                      |                      no                      |                                            |

| 433 |		[最小基因变化](https://leetcode-cn.com/problems/minimum-genetic-mutation/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/433-%E6%9C%80%E5%B0%8F%E5%9F%BA%E5%9B%A0%E5%8F%98%E5%8C%96.cpp)  |                      no                      |                      no                      |                                            |

| 435 |		[无重叠区间](https://leetcode-cn.com/problems/non-overlapping-intervals/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/435-%E6%97%A0%E9%87%8D%E5%8F%A0%E5%8C%BA%E9%97%B4.cpp)  |                      no                      |                      no                      |                                            |

| 436 |		[寻找右区间](https://leetcode-cn.com/problems/find-right-interval/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/436-%E5%AF%BB%E6%89%BE%E5%8F%B3%E5%8C%BA%E9%97%B4.cpp)  |                      no                      |                      no                      |                                            |

| 437 |		[路径总和3](https://leetcode-cn.com/problems/path-sum-iii/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/437-%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C%203.cpp)  |                      no                      |                      no                      |                                            |

| 442 |		[数组中的重复数据](https://leetcode-cn.com/problems/find-all-duplicates-in-an-array/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/442-%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E6%95%B0%E6%8D%AE.cpp)  |                      no                      |                      no                      |                                            |

| 445 |		[两数相加2](https://leetcode-cn.com/problems/add-two-numbers-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/445-%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0%202.cpp)  |                      no                      |                      no                      |                                            |

| 449 |		[序列化和反序列化二叉搜索树](https://leetcode-cn.com/problems/serialize-and-deserialize-bst/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/449-%E5%BA%8F%E5%88%97%E5%8C%96%E5%92%8C%E5%8F%8D%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.cpp)  |                      no                      |                      no                      |                                            |

| 450 |		[删除二叉搜索树中的节点](https://leetcode-cn.com/problems/delete-node-in-a-bst/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/450-%E5%88%A0%E9%99%A4%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.cpp)  |                      no                      |                      no                      |                                            |

| 451 |		[根据字符出现频率排序](https://leetcode-cn.com/problems/sort-characters-by-frequency/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/451-%E6%A0%B9%E6%8D%AE%E5%AD%97%E7%AC%A6%E5%87%BA%E7%8E%B0%E9%A2%91%E7%8E%87%E6%8E%92%E5%BA%8F.cpp)  |                      no                      |                      no                      |                                            |

| 452 |		[用最少数量的箭引爆气球](https://leetcode-cn.com/problems/minimum-number-of-arrows-to-burst-balloons/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/452-%E7%94%A8%E6%9C%80%E5%B0%91%E6%95%B0%E9%87%8F%E7%9A%84%E7%AE%AD%E5%BC%95%E7%88%86%E6%B0%94%E7%90%83.cpp)  |                      no                      |                      no                      |                                            |

| 454 |		[四数之和2](https://leetcode-cn.com/problems/4sum-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/454-%E5%9B%9B%E6%95%B0%E4%B9%8B%E5%92%8C2.cpp)  |                      no                      |                      no                      |                                            |

| 456 |		[132模式](https://leetcode-cn.com/problems/132-pattern/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/456-132%E6%A8%A1%E5%BC%8F.cpp)  |                      no                      |                      no                      |                                            |

| 462 |		[最少移动次数使数组元素相等2](https://leetcode-cn.com/problems/minimum-moves-to-equal-array-elements-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/462-%E6%9C%80%E5%B0%91%E7%A7%BB%E5%8A%A8%E6%AC%A1%E6%95%B0%E4%BD%BF%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E7%9B%B8%E7%AD%89%202.cpp)  |                      no                      |                      no                      |                                            |

| 472 |		[连接词](https://leetcode-cn.com/problems/concatenated-words/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/472-%E8%BF%9E%E6%8E%A5%E8%AF%8D.cpp)  |                      no                      |                      no                      |                                            |

| 474 |		 [一和零](https://leetcode-cn.com/problems/ones-and-zeroes/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/474-+%E4%B8%80%E5%92%8C%E9%9B%B6.cpp)  |                      no                      |                      no                      |                                            |

| 486 |		[预测赢家](https://leetcode-cn.com/problems/predict-the-winner/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/486-%E9%A2%84%E6%B5%8B%E8%B5%A2%E5%AE%B6.cpp)  |                      no                      |                      no                      |                                            |

| 488 |		[祖玛游戏](https://leetcode-cn.com/problems/zuma-game/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/488-%E7%A5%96%E7%8E%9B%E6%B8%B8%E6%88%8F.cpp)  |                      no                      |                      no                      |                                            |

| 491 |		[递增子序列](https://leetcode-cn.com/problems/increasing-subsequences/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/491-%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97.cpp)  |                      no                      |                      no                      |                                            |

| 494 |		[目标和](https://leetcode-cn.com/problems/target-sum/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/494-%E7%9B%AE%E6%A0%87%E5%92%8C.cpp)  |                      no                      |                      no                      |                                            |

| 495 |		[提莫攻击](https://leetcode-cn.com/problems/teemo-attacking/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/495-%E6%8F%90%E8%8E%AB%E6%94%BB%E5%87%BB.cpp)  |                      no                      |                      no                      |                                            |

| 501 |		[二叉搜索树中的众数](https://leetcode-cn.com/problems/find-mode-in-binary-search-tree/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/501-%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E4%BC%97%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 503 |		[下一个更大元素2](https://leetcode-cn.com/problems/next-greater-element-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/503-%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0%202.cpp)  |                      no                      |                      no                      |                                            |

| 508 |		[出现次数最多的子树元素和](https://leetcode-cn.com/problems/most-frequent-subtree-sum/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/508-%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E6%9C%80%E5%A4%9A%E7%9A%84%E5%AD%90%E6%A0%91%E5%85%83%E7%B4%A0%E5%92%8C.cpp)  |                      no                      |                      no                      |                                            |

| 513 |		[找树左下角的值](https://leetcode-cn.com/problems/find-bottom-left-tree-value/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/513-%E6%89%BE%E6%A0%91%E5%B7%A6%E4%B8%8B%E8%A7%92%E7%9A%84%E5%80%BC.cpp)  |                      no                      |                      no                      |                                            |

| 515 |		[在每个树行中找最大值](https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/515-%E5%9C%A8%E6%AF%8F%E4%B8%AA%E6%A0%91%E8%A1%8C%E4%B8%AD%E6%89%BE%E6%9C%80%E5%A4%A7%E5%80%BC.cpp)  |                      no                      |                      no                      |                                            |

| 516 |		[最长回文子序列](https://leetcode-cn.com/problems/longest-palindromic-subsequence/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/516-%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97.cpp)  |                      no                      |                      no                      |                                            |

| 518 |		[零钱兑换2](https://leetcode-cn.com/problems/coin-change-2/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/518-%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A22.cpp)  |                      no                      |                      no                      |                                            |

| 520 |		[检测大写字母](https://leetcode-cn.com/problems/detect-capital/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/520-%E6%A3%80%E6%B5%8B%E5%A4%A7%E5%86%99%E5%AD%97%E6%AF%8D.cpp)  |                      no                      |                      no                      |                                            |

| 524 |		[通过删除字母匹配到字典里最长单词](https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/524-%E9%80%9A%E8%BF%87%E5%88%A0%E9%99%A4%E5%AD%97%E6%AF%8D%E5%8C%B9%E9%85%8D%E5%88%B0%E5%AD%97%E5%85%B8%E9%87%8C%E6%9C%80%E9%95%BF%E5%8D%95%E8%AF%8D.cpp)  |                      no                      |                      no                      |                                            |

| 525 |		[连续数组](https://leetcode-cn.com/problems/contiguous-array/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/525-%E8%BF%9E%E7%BB%AD%E6%95%B0%E7%BB%84.cpp)  |                      no                      |                      no                      |                                            |

| 526 |		[优美的排列](https://leetcode-cn.com/problems/beautiful-arrangement/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/526-%E4%BC%98%E7%BE%8E%E7%9A%84%E6%8E%92%E5%88%97.cpp)  |                      no                      |                      no                      |                                            |

| 538 |		[把二叉搜索树转换为累加树](https://leetcode-cn.com/problems/convert-bst-to-greater-tree/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/538-%E6%8A%8A%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BD%AC%E6%8D%A2%E4%B8%BA%E7%B4%AF%E5%8A%A0%E6%A0%91.cpp)  |                      no                      |                      no                      |                                            |

| 540 |		[有序数组中的单一元素](https://leetcode-cn.com/problems/single-element-in-a-sorted-array/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/540-%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E5%8D%95%E4%B8%80%E5%85%83%E7%B4%A0.cpp)  |                      no                      |                      no                      |                                            |

| 542 |		[01矩阵](https://leetcode-cn.com/problems/01-matrix/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/542-01%20%E7%9F%A9%E9%98%B5.cpp)  |                      no                      |                      no                      |                                            |

| 543 |		[二叉树的直径](https://leetcode-cn.com/problems/diameter-of-binary-tree/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/543-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E7%9B%B4%E5%BE%84.cpp)  |                      no                      |                      no                      |                                            |

| 547 |		[朋友圈](https://leetcode-cn.com/problems/friend-circles/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/547-%E6%9C%8B%E5%8F%8B%E5%9C%88.cpp)  |                      no                      |                      no                      |                                            |

| 552 |		[学生出勤记录](https://leetcode-cn.com/problems/student-attendance-record-ii/) 		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/552-%E5%AD%A6%E7%94%9F%E5%87%BA%E5%8B%A4%E8%AE%B0%E5%BD%95+.cpp)  |                      no                      |                      no                      |                                            |

| 554 |		[砖墙](https://leetcode-cn.com/problems/brick-wall/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/554-%E7%A0%96%E5%A2%99.cpp)  |                      no                      |                      no                      |                                            |

| 559 |		[N叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-n-ary-tree/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/559-N%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6.cpp)  |                      no                      |                      no                      |                                            |

| 560 |		[和为K的子数组](https://leetcode-cn.com/problems/subarray-sum-equals-k/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/560-%E5%92%8C%E4%B8%BAK%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.cpp)  |                      no                      |                      no                      |                                            |

| 572 |		[另一个树的子树](https://leetcode-cn.com/problems/subtree-of-another-tree/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/572-%E5%8F%A6%E4%B8%80%E4%B8%AA%E6%A0%91%E7%9A%84%E5%AD%90%E6%A0%91.cpp)  |                      no                      |                      no                      |                                            |

| 576 |		[出界的路径数](https://leetcode-cn.com/problems/out-of-boundary-paths/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/576-%E5%87%BA%E7%95%8C%E7%9A%84%E8%B7%AF%E5%BE%84%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 583 |		[两个字符串的删除操作](https://leetcode-cn.com/problems/delete-operation-for-two-strings/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/583-%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%88%A0%E9%99%A4%E6%93%8D%E4%BD%9C.cpp)  |                      no                      |                      no                      |                                            |

| 589 |		[N叉树的前序遍历](https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/589-N%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86.cpp)  |                      no                      |                      no                      |                                            |

| 590 |		[N叉树的后序遍历](https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/590-N%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86.cpp)  |                      no                      |                      no                      |                                            |

| 617 |		[合并二叉树](https://leetcode-cn.com/problems/merge-two-binary-trees/)		| Easy | [Code](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/C%2B%2B%E7%89%88/617-%E5%90%88%E5%B9%B6%E4%BA%8C%E5%8F%89%E6%A0%91.cpp)  |                      no                      |                      no                      |                                            |

| 623 |		[在二叉树中增加一行](https://leetcode-cn.com/problems/add-one-row-to-tree/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/623-%E5%9C%A8%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E5%A2%9E%E5%8A%A0%E4%B8%80%E8%A1%8C.cpp)  |                      no                      |                      no                      |                                            |

| 630 |		[课程表3](https://leetcode-cn.com/problems/course-schedule-iii/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/630-%E8%AF%BE%E7%A8%8B%E8%A1%A8%203.cpp)  |                      no                      |                      no                      |                                            |

| 637 |		[二叉树的层平均值](https://leetcode-cn.com/problems/average-of-levels-in-binary-tree/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/637-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%B9%B3%E5%9D%87%E5%80%BC.cpp)  |                      no                      |                      no                      |                                            |

| 646 |		[最长数对链](https://leetcode-cn.com/problems/maximum-length-of-pair-chain/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/646-%E6%9C%80%E9%95%BF%E6%95%B0%E5%AF%B9%E9%93%BE.cpp)  |                      no                      |                      no                      |                                            |

| 647 |		[回文子串](https://leetcode-cn.com/problems/palindromic-substrings/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/647-%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.cpp)  |                      no                      |                      no                      |                                            |

| 650 |		[只有两个键的键盘](https://leetcode-cn.com/problems/2-keys-keyboard/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/650-%E5%8F%AA%E6%9C%89%E4%B8%A4%E4%B8%AA%E9%94%AE%E7%9A%84%E9%94%AE%E7%9B%98.cpp)  |                      no                      |                      no                      |                                            |

| 654 |		[最大二叉树](https://leetcode-cn.com/problems/maximum-binary-tree/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/654-%E6%9C%80%E5%A4%A7%E4%BA%8C%E5%8F%89%E6%A0%91.cpp)  |                      no                      |                      no                      |                                            |

| 655 |		[输出二叉树](https://leetcode-cn.com/problems/print-binary-tree/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/655-%E8%BE%93%E5%87%BA%E4%BA%8C%E5%8F%89%E6%A0%91.cpp)  |                      no                      |                      no                      |                                            |

| 658 |		[找到 K 个最接近的元素](https://leetcode-cn.com/problems/find-k-closest-elements/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/658-%E6%89%BE%E5%88%B0+K+%E4%B8%AA%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E5%85%83%E7%B4%A0.cpp)  |                      no                      |                      no                      |                                            |

| 662 |		[二叉树最大宽度](https://leetcode-cn.com/problems/maximum-width-of-binary-tree/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/662-%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%A4%A7%E5%AE%BD%E5%BA%A6.cpp)  |                      no                      |                      no                      |                                            |

| 670 |		[最大交换](https://leetcode-cn.com/problems/maximum-swap/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/670-%E6%9C%80%E5%A4%A7%E4%BA%A4%E6%8D%A2.cpp)  |                      no                      |                      no                      |                                            |

| 671 |		[二叉树中第二小的节点](https://leetcode-cn.com/problems/second-minimum-node-in-a-binary-tree/)		| Easy | [Code](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/C%2B%2B%E7%89%88/671-%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%AC%AC%E4%BA%8C%E5%B0%8F%E7%9A%84%E8%8A%82%E7%82%B9.cpp)  |                      no                      |                      no                      |                                            |

| 673 |		[最长递增子序列的个数](https://leetcode-cn.com/problems/number-of-longest-increasing-subsequence/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/673-%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 677 |		[键值映射](https://leetcode-cn.com/problems/map-sum-pairs/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/677-%E9%94%AE%E5%80%BC%E6%98%A0%E5%B0%84.cpp)  |                      no                      |                      no                      |                                            |

| 678 |		[有效的括号字符串](https://leetcode-cn.com/problems/valid-parenthesis-string/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/678-%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7%E5%AD%97%E7%AC%A6%E4%B8%B2.cpp)  |                      no                      |                      no                      |                                            |

| 679 |		[24点游戏](https://leetcode-cn.com/problems/24-game/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/679-24%E7%82%B9%E6%B8%B8%E6%88%8F.cpp)  |                      no                      |                      no                      |                                            |

| 684 |		[冗余连接](https://leetcode-cn.com/problems/redundant-connection/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/684-%E5%86%97%E4%BD%99%E8%BF%9E%E6%8E%A5.cpp)  |                      no                      |                      no                      |                                            |

| 688 |		[“马”在棋盘上的概率](https://leetcode-cn.com/problems/knight-probability-in-chessboard/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/688-%E2%80%9C%E9%A9%AC%E2%80%9D%E5%9C%A8%E6%A3%8B%E7%9B%98%E4%B8%8A%E7%9A%84%E6%A6%82%E7%8E%87.cpp)  |                      no                      |                      no                      |                                            |

| 692 |		[前K个高频单词](https://leetcode-cn.com/problems/top-k-frequent-words/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/692-%E5%89%8DK%E4%B8%AA%E9%AB%98%E9%A2%91%E5%8D%95%E8%AF%8D.cpp)  |                      no                      |                      no                      |                                            |

| 700 |		[二叉搜索树中的搜索](https://leetcode-cn.com/problems/search-in-a-binary-search-tree/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/700-%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E6%90%9C%E7%B4%A2.cpp)  |                      no                      |                      no                      |                                            |

| 701 |		[二叉搜索树中的插入操作](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/701-%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E6%8F%92%E5%85%A5%E6%93%8D%E4%BD%9C.cpp)  |                      no                      |                      no                      |                                            |

| 704 |		[二分查找](https://leetcode-cn.com/problems/binary-search/)		| Easy | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/704-%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE.cpp)  |                      no                      |                      no                      |                                            |

| 712 |		[两个字符串的最小ASCII删除和](https://leetcode-cn.com/problems/minimum-ascii-delete-sum-for-two-strings/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/712-%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%B0%8FASCII%E5%88%A0%E9%99%A4%E5%92%8C.cpp)  |                      no                      |                      no                      |                                            |

| 718 |		[最长重复子数组](https://leetcode-cn.com/problems/maximum-length-of-repeated-subarray/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/718-%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%90%E6%95%B0%E7%BB%84.cpp)  |                      no                      |                      no                      |                                            |

| 721 |		[账户合并](https://leetcode-cn.com/problems/accounts-merge/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/721-%E8%B4%A6%E6%88%B7%E5%90%88%E5%B9%B6.cpp)  |                      no                      |                      no                      |                                            |

| 725 |		[分隔链表](https://leetcode-cn.com/problems/split-linked-list-in-parts/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/725-%E5%88%86%E9%9A%94%E9%93%BE%E8%A1%A8.cpp)  |                      no                      |                      no                      |                                            |

| 729 |		[我的日程安排表1](https://leetcode-cn.com/problems/my-calendar-i/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/729-%E6%88%91%E7%9A%84%E6%97%A5%E7%A8%8B%E5%AE%89%E6%8E%92%E8%A1%A8%201.cpp)  |                      no                      |                      no                      |                                            |

| 731 |		[我的日程安排表2](https://leetcode-cn.com/problems/my-calendar-ii/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/731-%E6%88%91%E7%9A%84%E6%97%A5%E7%A8%8B%E5%AE%89%E6%8E%92%E8%A1%A8%202.cpp)  |                      no                      |                      no                      |                                            |

| 738 |		[单调递增的数字](https://leetcode-cn.com/problems/monotone-increasing-digits/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/738-%E5%8D%95%E8%B0%83%E9%80%92%E5%A2%9E%E7%9A%84%E6%95%B0%E5%AD%97.cpp)  |                      no                      |                      no                      |                                            |

| 739 |		[每日温度](https://leetcode-cn.com/problems/daily-temperatures/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/739-%E6%AF%8F%E6%97%A5%E6%B8%A9%E5%BA%A6.cpp)  |                      no                      |                      no                      |                                            |

| 740 |		[删除与获得点数](https://leetcode-cn.com/problems/delete-and-earn/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/740-%E5%88%A0%E9%99%A4%E4%B8%8E%E8%8E%B7%E5%BE%97%E7%82%B9%E6%95%B0.cpp)  |                      no                      |                      no                      |                                            |

| 743 |		[网络延迟时间](https://leetcode-cn.com/problems/network-delay-time/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/743-%E7%BD%91%E7%BB%9C%E5%BB%B6%E8%BF%9F%E6%97%B6%E9%97%B4.cpp)  |                      no                      |                      no                      |                                            |

| 765 |		[情侣牵手](https://leetcode-cn.com/problems/couples-holding-hands/)		| Hard | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/765-%E6%83%85%E4%BE%A3%E7%89%B5%E6%89%8B.cpp)  |                      no                      |                      no                      |                                            |

| 797 |		[所有可能路径](https://leetcode-cn.com/problems/all-paths-from-source-to-target/)		| Easy | [Code](https://github.com/Perry961002/Algorithms-LeetCode/blob/master/C%2B%2B%E7%89%88/797-%E6%89%80%E6%9C%89%E5%8F%AF%E8%83%BD%E8%B7%AF%E5%BE%84.cpp)  |                      no                      |                      no                      |                                            |

| 802 |		[找到最终的安全状态](https://leetcode-cn.com/problems/find-eventual-safe-states/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/802-%E6%89%BE%E5%88%B0%E6%9C%80%E7%BB%88%E7%9A%84%E5%AE%89%E5%85%A8%E7%8A%B6%E6%80%81.cpp)  |                      no                      |                      no                      |                                            |

| 807 |		[保持城市天际线](https://leetcode-cn.com/problems/max-increase-to-keep-city-skyline/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/807-%E4%BF%9D%E6%8C%81%E5%9F%8E%E5%B8%82%E5%A4%A9%E9%99%85%E7%BA%BF.cpp)  |                      no                      |                      no                      |                                            |

| 814 |		[二叉树剪枝](https://leetcode-cn.com/problems/binary-tree-pruning/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/814-%E4%BA%8C%E5%8F%89%E6%A0%91%E5%89%AA%E6%9E%9D.cpp)  |                      no                      |                      no                      |                                            |

| 841 |		[钥匙和房间](https://leetcode-cn.com/problems/keys-and-rooms/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/841-%E9%92%A5%E5%8C%99%E5%92%8C%E6%88%BF%E9%97%B4.cpp)  |                      no                      |                      no                      |                                            |

| 894 |		[所有可能的满二叉树](https://leetcode-cn.com/problems/all-possible-full-binary-trees/)		| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/894-%E6%89%80%E6%9C%89%E5%8F%AF%E8%83%BD%E7%9A%84%E6%BB%A1%E4%BA%8C%E5%8F%89%E6%A0%91.cpp)  |                      no                      |                      no                      |                                            |

| 919 |	[完全二叉树插入器]()	| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/919-complete-binary-tree-inserter.cpp) |  | [Code](https://github.com/Perry961002/LeetCode/blob/master/Python/919-complete-binary-tree-inserter.py) | [Code](https://github.com/Perry961002/LeetCode/blob/master/Go/919-complete-binary-tree-inserter.go) |

| 987 |	[二叉树的垂序遍历]()	| Medium | [Code](https://github.com/Perry961002/LeetCode/blob/master/C%2B%2B%E7%89%88/987-vertical-order-traversal-of-a-binary-tree.cpp) |  |  | |