LeetCode 404 Sum of Left Leaves (DFS)

最新推荐文章于 2020-07-13 01:21:02 发布

_TCgogogo_

最新推荐文章于 2020-07-13 01:21:02 发布

阅读量822

点赞数

分类专栏： Leetcode Easy LeetCode 文章标签： LeetCode DFS

本文链接：https://blog.csdn.net/Tc_To_Top/article/details/52902267

版权

LeetCode 同时被 2 个专栏收录

334 篇文章 5 订阅

订阅专栏

Leetcode Easy

48 篇文章 0 订阅

订阅专栏

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.

题目链接：https://leetcode.com/problems/sum-of-left-leaves/

题目分析：是左叶子的条件为当前点的左结点存在，且左结点为叶子结点

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    
    public void DFS(TreeNode root, int[] sum) {
        if (root.left != null) {
            DFS(root.left, sum);
        }
        if (root.right != null) {
            DFS(root.right, sum);
        }
        if (root.left != null && root.left.left == null && root.left.right == null) {
            sum[0] += root.left.val;
        } 
    }
    
    public int sumOfLeftLeaves(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int[] sum = new int[1];
        DFS(root, sum);
        return sum[0];
    }
}