public class Solution {
int sum = 0;
public int sumOfLeftLeaves(TreeNode root) {
dfs(root);
return sum;
}
public void dfs(TreeNode root) {
if(root == null) {
return;
}
if(root.left!=null && root.left.left==null && root.left.right == null) {
sum+=root.left.val;
}
dfs(root.left);
dfs(root.right);
}
}
404. Sum of Left Leaves
最新推荐文章于 2024-07-10 11:26:09 发布