We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 90334f9 + 59dbd11 commit 5f222c8Copy full SHA for 5f222c8
README.md
@@ -17,6 +17,7 @@ Python solution
17
|590|n叉树的后序遍历|[Recursive](./easy/tree/590.n叉树的后序遍历.py)|tree|
18
|543|二叉树的直径|[Recursive](./easy/tree/543.二叉树的直径(recursive).py), [divide and conquer](./easy/tree/543.二叉树的直径(divideandconquer).py)|tree|
19
|226|翻转二叉树|[Recursive](./easy/tree/226.翻转二叉树.py)|tree|
20
+|202|happyNumber|[array](./easy/array/202.happyNumber.py)|array|
21
|111|二叉树的最小深度|[Recursive](./easy/tree/111.二叉树的最小深度.py), [dfs-todo](./)|tree|
22
|110|平衡二叉树|[Recursive](./easy/tree/110.平衡二叉树.py)|tree|
23
|104|二叉树的最大深度|[Recursive](./easy/tree/104.二叉树的最大深度.py)|tree|
0 commit comments