Skip to content

Commit 1042be2

Browse files
deweyoudeweyou
committed
feat: leetcode 222
1 parent 4040724 commit 1042be2

File tree

5 files changed

+49
-6
lines changed

5 files changed

+49
-6
lines changed

‎assets/data/category.json

Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -449,6 +449,12 @@
449449
"path": "../../problemset/find-peak-element/README.md",
450450
"difficulty": "中等"
451451
},
452+
{
453+
"id": 222,
454+
"title": "完全二叉树的节点个数",
455+
"path": "../../problemset/count-complete-tree-nodes/README.md",
456+
"difficulty": "中等"
457+
},
452458
{
453459
"id": 300,
454460
"title": "最长递增子序列",
@@ -1832,6 +1838,12 @@
18321838
"path": "../../problemset/course-schedule-2/README.md",
18331839
"difficulty": "中等"
18341840
},
1841+
{
1842+
"id": 222,
1843+
"title": "完全二叉树的节点个数",
1844+
"path": "../../problemset/count-complete-tree-nodes/README.md",
1845+
"difficulty": "中等"
1846+
},
18351847
{
18361848
"id": 589,
18371849
"title": "N 叉树的前序遍历",
@@ -2157,6 +2169,12 @@
21572169
"path": "../../problemset/binary-tree-right-side-view/README.md",
21582170
"difficulty": "中等"
21592171
},
2172+
{
2173+
"id": 222,
2174+
"title": "完全二叉树的节点个数",
2175+
"path": "../../problemset/count-complete-tree-nodes/README.md",
2176+
"difficulty": "中等"
2177+
},
21602178
{
21612179
"id": 589,
21622180
"title": "N 叉树的前序遍历",
@@ -2245,6 +2263,12 @@
22452263
"path": "../../problemset/bitwise-and-of-numbers-range/README.md",
22462264
"difficulty": "中等"
22472265
},
2266+
{
2267+
"id": 222,
2268+
"title": "完全二叉树的节点个数",
2269+
"path": "../../problemset/count-complete-tree-nodes/README.md",
2270+
"difficulty": "中等"
2271+
},
22482272
{
22492273
"id": 393,
22502274
"title": "UTF-8 编码验证",

‎assets/data/problems.json

Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1969,6 +1969,16 @@
19691969
"url": "https://leetcode-cn.com/problems/maximal-square/",
19701970
"path": "../../problemset/maximal-square/README.md"
19711971
},
1972+
{
1973+
"id": 222,
1974+
"title": {
1975+
"cn": "完全二叉树的节点个数",
1976+
"en": "count-complete-tree-nodes"
1977+
},
1978+
"difficulty": "中等",
1979+
"url": "https://leetcode-cn.com/problems/count-complete-tree-nodes/",
1980+
"path": "../../problemset/count-complete-tree-nodes/README.md"
1981+
},
19721982
{
19731983
"id": 258,
19741984
"title": {

‎assets/docs/CATEGORY.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -91,6 +91,7 @@
9191
| 153. [寻找旋转排序数组中的最小值](../../problemset/find-minimum-in-rotated-sorted-array/README.md) | 中等 |
9292
| 154. [寻找旋转排序数组中的最小值 II](../../problemset/find-minimum-in-rotated-sorted-array-2/README.md) | 困难 |
9393
| 162. [寻找峰值](../../problemset/find-peak-element/README.md) | 中等 |
94+
| 222. [完全二叉树的节点个数](../../problemset/count-complete-tree-nodes/README.md) | 中等 |
9495
| 300. [最长递增子序列](../../problemset/longest-increasing-subsequence/README.md) | 中等 |
9596
| 540. [有序数组中的单一元素](../../problemset/single-element-in-a-sorted-array/README.md) | 中等 |
9697
| 744. [寻找比目标字母大的最小字母](../../problemset/find-smallest-letter-greater-than-target/README.md) | 简单 |
@@ -359,6 +360,7 @@
359360
| 206. [反转链表](../../problemset/reverse-linked-list/README.md) | 简单 |
360361
| 207. [课程表](../../problemset/course-schedule/README.md) | 中等 |
361362
| 210. [课程表 II](../../problemset/course-schedule-2/README.md) | 中等 |
363+
| 222. [完全二叉树的节点个数](../../problemset/count-complete-tree-nodes/README.md) | 中等 |
362364
| 589. [N 叉树的前序遍历](../../problemset/n-ary-tree-preorder-traversal/README.md) | 简单 |
363365
| 590. [N 叉树的后序遍历](../../problemset/n-ary-tree-postorder-traversal/README.md) | 简单 |
364366
| 606. [根据二叉树创建字符串](../../problemset/construct-string-from-binary-tree/README.md) | 简单 |
@@ -434,6 +436,7 @@
434436
| 145. [二叉树的后序遍历](../../problemset/binary-tree-postorder-traversal/README.md) | 简单 |
435437
| 173. [二叉搜索树迭代器](../../problemset/binary-search-tree-iterator/README.md) | 中等 |
436438
| 199. [二叉树的右视图](../../problemset/binary-tree-right-side-view/README.md) | 中等 |
439+
| 222. [完全二叉树的节点个数](../../problemset/count-complete-tree-nodes/README.md) | 中等 |
437440
| 589. [N 叉树的前序遍历](../../problemset/n-ary-tree-preorder-traversal/README.md) | 简单 |
438441
| 606. [根据二叉树创建字符串](../../problemset/construct-string-from-binary-tree/README.md) | 简单 |
439442
| 653. [两数之和 IV - 输入 BST](../../problemset/two-sum-iv-input-is-a-bst/README.md) | 简单 |
@@ -457,6 +460,7 @@
457460
| 190. [颠倒二进制位](../../problemset/reverse-bits/README.md) | 简单 |
458461
| 191. [位1的个数](../../problemset/number-of-1-bits/README.md) | 简单 |
459462
| 201. [数字范围按位与](../../problemset/bitwise-and-of-numbers-range/README.md) | 中等 |
463+
| 222. [完全二叉树的节点个数](../../problemset/count-complete-tree-nodes/README.md) | 中等 |
460464
| 393. [UTF-8 编码验证](../../problemset/utf-8-validation/README.md) | 中等 |
461465
| 693. [交替位二进制数](../../problemset/binary-number-with-alternating-bits/README.md) | 简单 |
462466
| 762. [二进制表示中质数个计算置位](../../problemset/prime-number-of-set-bits-in-binary-representation/README.md) | 简单 |

‎assets/docs/PROBLEMS.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -394,6 +394,8 @@
394394

395395
[221. 最大正方形](../../problemset/maximal-square/README.md)
396396

397+
[222. 完全二叉树的节点个数](../../problemset/count-complete-tree-nodes/README.md)
398+
397399
[258. 各位相加](../../problemset/add-digits/README.md)
398400

399401
[300. 最长递增子序列](../../problemset/longest-increasing-subsequence/README.md)

‎vitest.config.ts

Lines changed: 9 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,14 @@
11
/// <reference types="vitest" />
2-
import path from 'path';
3-
import { defineConfig } from 'vite';
2+
import path from 'path'
3+
import { defineConfig } from 'vite'
44

55
export default defineConfig({
66
resolve: {
77
alias: {
8-
'~/': `${path.resolve(__dirname, '.')}/`
9-
}
10-
}
11-
});
8+
'~/': `${path.resolve(__dirname, '.')}/`,
9+
},
10+
},
11+
test: {
12+
testTimeout: 5000,
13+
},
14+
})

0 commit comments

Comments
 (0)