101 |
Symmetrical binary tree |
tree |
simple |
✅ |
102 |
Binary tree hierarchy traversal |
tree |
medium |
|
103 |
Zigzag-level binary tree traversal |
tree |
medium |
|
104 |
The maximum depth of the binary tree |
tree |
simple |
|
105 |
Previous order and sequence preorder binary tree structure |
tree |
medium |
|
106 |
From the order sequence postorder binary tree structure |
tree |
medium |
|
107 |
Binary tree hierarchy traversal II |
tree |
simple |
|
108 |
Ordered arrays to convert binary search tree |
tree |
simple |
|
109 |
Ordered list convert binary search tree |
tree |
medium |
|
110 |
Balanced binary tree |
tree |
simple |
|
111 |
The minimum depth of the binary tree |
tree |
simple |
|
112 |
Path sum |
tree |
simple |
|
113 |
The sum of the path II |
tree |
medium |
|
114 |
Binary tree expands to list |
tree |
medium |
|
115 |
Different sequences |
动态规划 |
difficult |
|
116 |
The next right node pointer to fill each node |
tree |
medium |
|
117 |
The next right node pointer II fill each node |
tree |
medium |
|
118 |
Pascal's Triangle |
Double pointer |
simple |
|
119 |
Pascal's Triangle II |
Double pointer |
simple |
|
120 |
Triangles and minimum path |
动态规划 |
medium |
|
121 |
The best time to stock trading |
动态规划 |
simple |
|
122 |
The best time to buy and sell stocks II |
贪心算法 |
simple |
|
123 |
The best time to buy and sell stocks III |
动态规划 |
difficult |
|
124 |
The maximum path and binary tree |
tree |
difficult |
|
125 |
Verify palindromic sequence |
Double pointer |
simple |
|
126 |
Word Solitaire II |
|
difficult |
|
127 |
Word Solitaire |
|
medium |
|
128 |
The longest continuous sequence |
|
difficult |
|
129 |
Roots and leaves to node sum of the numbers |
tree |
medium |
|
130 |
Area surrounded by |
|
medium |
|
131 |
Segmentation palindromic sequence |
|
medium |
|
132 |
Dividing palindromic sequence II |
|
difficult |
|
133 |
FIG Cloning |
|
medium |
|
134 |
gas |
|
medium |
|
135 |
Distribute candy |
|
difficult |
|
136 |
The number appears only once |
|
simple |
|
137 |
It appears only once in the Digital II |
|
medium |
|
138 |
Copy pointer list with Random |
List |
medium |
|
139 |
Split words |
|
medium |
|
140 |
Split words II |
|
difficult |
|
141 |
Circular linked list |
|
simple |
|
142 |
Circular linked list II |
|
medium |
|
143 |
Rearrangements list |
|
medium |
|
144 |
Preamble binary tree traversal |
|
medium |
|
145 |
After the binary tree traversal sequence |
|
difficult |
|
146 |
LRU cache mechanism |
|
medium |
|
147 |
Insertion Sort to list |
|
medium |
|
148 |
Sort the list |
|
medium |
|
149 |
The most points on a straight line |
|
difficult |
|
150 |
Reverse Polish expression evaluation |
|
medium |
|
151 |
Flip words in strings |
|
medium |
|
152 |
Product of the maximum subsequence |
|
medium |
|
153 |
Find the minimum value in sorted array rotation |
|
medium |
|
154 |
Find the minimum value in sorted array rotating II |
|
difficult |
|
155 |
The minimum stack |
|
simple |
|
156 |
Binary tree upside down |
|
medium |
|
157 |
用 Read4 读取 N 个字符 |
|
简单 |
|
158 |
用 Read4 读取 N 个字符 II |
|
困难 |
|
159 |
至多包含两个不同字符的最长子串 |
|
中等 |
|
160 |
相交链表 |
|
简单 |
|
161 |
相隔为 1 的编辑距离 |
|
中等 |
|
162 |
寻找峰值 |
|
中等 |
|
163 |
缺失的区间 |
|
中等 |
|
164 |
最大间距 |
|
困难 |
|
165 |
比较版本号 |
|
中等 |
|
166 |
分数到小数 |
==== |
中等 |
|
167 |
两数之和 II - 输入有序数组 |
==== |
简单 |
|
168 |
Excel表列名称 |
==== |
简单 |
|
169 |
多数元素 |
二分查找 |
简单 |
|
170 |
两数之和 III - 数据结构设计 |
|
简单 |
|
171 |
Excel表列序号 |
==== |
简单 |
|
172 |
阶乘后的零 |
|
简单 |
|
173 |
二叉搜索树迭代器 |
==== |
中等 |
|
174 |
地下城游戏 |
|
困难 |
|
175 |
组合两个表 |
|
简单 |
|
176 |
第二高的薪水 |
|
简单 |
|
177 |
第N高的薪水 |
|
中等 |
|
178 |
分数排名 |
|
中等 |
|
179 |
最大数 |
|
中等 |
|
186 |
翻转字符串里的单词 II |
|
中等 |
|
187 |
重复的DNA序列 |
|
中等 |
|
188 |
买卖股票的最佳时机 IV |
==== |
困难 |
|
189 |
旋转数组 |
==== |
简单 |
|
190 |
颠倒二进制位 |
==== |
简单 |
|
191 |
位1的个数 |
==== |
简单 |
|
198 |
打家劫舍 |
树 |
简单 |
|
199 |
二叉树的右视图 |
树 |
中等 |
|
200 |
岛屿数量 |
树 |
中等 |
|