目录
题目:
代码(首刷看解析):
class Solution {
public:
int sumOfLeftLeaves(TreeNode* root) {
int res = 0;
if (root == nullptr) return res;
queue<TreeNode*> que;
TreeNode* cur = root;
que.push(cur);
int size = 0;
while (!que.empty()) {
size = que.size();
while (size--) {
TreeNode* node = que.front();
que.pop();
if (node->left) {
que.push(node->left);
if (node->left->left == nullptr &&
node->left->right == nullptr) {
res += node->left->val;
}
}
if (node->right) que.push(node->right);
}
}
return res;
}
};
代码(二刷自解 2024年5月9日 4min)
class Solution {
public:
int sumOfLeftLeaves(TreeNode* root) {
if(!root) return 0;
queue<TreeNode*> q;
q.push(root);
int res = 0;
while (!q.empty()) {
int size = q.size();
while(size--) {
TreeNode* node = q.front();
q.pop();
if (node->left) {
if (!node->left->left && !node->left->right) res += node->left->val;
q.push(node->left);
}
if (node->right) q.push(node->right);
}
}
return res;
}
};