HackMD- hlc23·Last edited by hlc23 on Jun 19, 2023Linked with GitHubContributed by
There is no commentSelect some text and then click Comment, or simply add a comment to this page from below to start a discussion.Dark Theme License
The MIT License (MIT)
Copyright © 2022-2023 Lumynous
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
1161. Maximum Level Sum of a Binary Tree
題目連結: Leetcode
題目概要
給一二分樹, 問哪一層的節點數值和最大
想法
BFS
用BFS的方式走過一層所有的節點並計算和後再往下一層
BFS使用Queue進行實做
每新的一層就先紀錄Queue大小
接著從Queue中拿
參考解法
歡迎補充
C++ BFS
class Solution {
public:
int maxLevelSum(TreeNode* root) {
int level = 0;
int sum = INT_MIN;
int current, ans;
queue<TreeNode*> q;
q.push(root);
while (!q.empty()){
current = 0;
level++;
for (int i=q.size();i>0; i--){
TreeNode *node = q.front();
q.pop();
current += node->val;
if (node->left != nullptr) q.push(node->left);
if (node->right != nullptr) q.push(node->right);
}
if (current > sum){
sum = current;
ans = level;
}
}
return ans;
}
};
Dark Theme License
The MIT License (MIT)
Copyright © 2022 Luminous-Coder
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
