【LeetCode】404.Sum of Left Leaves(Easy)解题报告

【LeetCode】404.Sum of Left Leaves(Easy)解题报告

题目地址：https://leetcode.com/problems/sum-of-left-leaves/description/
题目描述：

  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.

Solution1:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 先判断左孩子，在判断是不是叶子节点
 time : O(n)
 space : O(n)
 */
class Solution {
    public int sumOfLeftLeaves(TreeNode root) {
        if(root == null) return 0;
        int res = 0;
        if(root.left!=null){
            if(root.left.left==null && root.left.right==null){
                res += root.left.val;
            }else res += sumOfLeftLeaves(root.left);
        }
        res += sumOfLeftLeaves(root.right);
        return res;
    }
}

Solution2：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 先判断左孩子，在判断是不是叶子节点
 time : O(n)
 space : O(n)
 */
class Solution {
    public int sumOfLeftLeaves(TreeNode root) {
        if(root == null) return 0;
        int res = 0;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while(!queue.isEmpty()){
            TreeNode cur = queue.poll();
            if(cur.left!=null){
                if(cur.left.left==null && cur.left.right==null){
                    res += cur.left.val;
                }else queue.offer(cur.left);
            }
            if(cur.right!=null){
                queue.offer(cur.right);
            }
        }
        return res;
    }
}

Date：2018年3月19日