/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int sum=0;
int sumOfLeftLeaves(TreeNode* root) {
if(root==nullptr) return 0;
dfs(root,false);
return sum;
}
void dfs(TreeNode* root,bool isleft){
if(root->left==nullptr&&root->right==nullptr){ //死胡同
if(isleft) sum+=root->val; //是左叶子
return;
}
if(root->left!=nullptr) dfs(root->left,true);
if(root->right!=nullptr) dfs(root->right,false);
}
};
LeetCode-404. 左叶子之和-easy
最新推荐文章于 2024-05-21 23:16:53 发布