Skip to content
This repository was archived by the owner on Sep 20, 2023. It is now read-only.

Commit dd684db

Browse files
aQuaaQua
aQua
authored and
aQua
committed
更新README.md
1 parent 57a2696 commit dd684db

File tree

2 files changed

+4
-3
lines changed

2 files changed

+4
-3
lines changed

README.md

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -10,9 +10,9 @@
1010
1111
|Category|Easy|Medium|Hard|Total|
1212
|:--|:--:|:--:|:--:|:--:|
13-
|**Algorithms**|45 / 145|80 / 250|29 / 93|154 / 488|
13+
|**Algorithms**|46 / 145|80 / 250|29 / 93|155 / 488|
1414
|**Draft**|0 / 1|0 / 3|0 / 0|0 / 4|
15-
|**Total**|45 / 146|80 / 253|29 / 93|154 / 492|
15+
|**Total**|46 / 146|80 / 253|29 / 93|155 / 492|
1616

1717
## 参考解答
1818
|题号|题目|难度|总体通过率|收藏|
@@ -120,6 +120,7 @@
120120
|101|[Symmetric Tree](./Algorithms/0101.symmetric-tree)||38%||
121121
|102|[Binary Tree Level Order Traversal](./Algorithms/0102.binary-tree-level-order-traversal)|☆ ☆|40%||
122122
|103|[Binary Tree Zigzag Level Order Traversal](./Algorithms/0103.binary-tree-zigzag-level-order-traversal)|☆ ☆|34%||
123+
|104|[Maximum Depth of Binary Tree](./Algorithms/0104.maximum-depth-of-binary-tree)||52%||
123124
|105|[Construct Binary Tree from Preorder and Inorder Traversal](./Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal)|☆ ☆|32%||
124125
|106|[Construct Binary Tree from Inorder and Postorder Traversal](./Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal)|☆ ☆|32%||
125126
|118|[Pascal's Triangle](./Algorithms/0118.pascals-triangle)||38%||

leetcode.json

Lines changed: 1 addition & 1 deletion
Large diffs are not rendered by default.

0 commit comments

Comments
 (0)