LeetCode - 404. Sum of Left Leaves
Find the sum of all left leaves in a given binary tree.
Example:
3 / \ 9 20 / \ 15 7 There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { private int sum; public int sumOfLeftLeaves(TreeNode root) { if (root == null) return 0; if (root.left == null && root.right == null) return 0; solve(root); return sum; } private void solve(TreeNode root) { if (root == null) return ; if (root.left != null) { if (root.left.left == null && root.left.right == null) sum += root.left.val; } solve(root.left); solve(root.right); } }
作者:Pickle
声明:对于转载分享我是没有意见的,出于对博客园社区和作者的尊重一定要保留原文地址哈。
致读者:坚持写博客不容易,写高质量博客更难,我也在不断的学习和进步,希望和所有同路人一道用技术来改变生活。觉得有点用就点个赞哈。