CS_learn/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2026-02-02 18:39:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update

Browse Source
This commit is contained in:
youngyangyang04
2020-10-25 21:16:59 +08:00
parent 4c2a526e96
commit 7343c01b56
11 changed files with 386 additions and 61 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
problems/0104.二叉树的最大深度.md
View File

@@ -174,12 +174,13 @@ public:
int depth = 0;
while (!que.empty()) {
int size = que.size();
vector<int> vec;
depth++; // 记录深度
for (int i = 0; i < size; i++) {
Node* node = que.front();
que.pop();
for (int i = 0; i < node->children.size(); i++) {
if (node->children[i]) que.push(node->children[i]);
for (int j = 0; j < node->children.size(); j++) {
if (node->children[j]) que.push(node->children[j]);
}
}
}