/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public int sumOfLeftLeaves(TreeNode root) {
if(root == null){
return 0;
}
int leftVal = sumOfLeftLeaves(root.left);
int rightVal = sumOfLeftLeaves(root.right);
int midVal = 0;
if(root.left != null && root.left.left == null && root.left.right == null){
midVal = root.left.val;
}
int sum = leftVal + rightVal +midVal;
return sum;
}
}
代码随想录——404. 左叶子之和
最新推荐文章于 2024-07-24 22:13:06 发布