Leetcode-404. Sum of Left Leaves

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN，mcf171专栏。

博客链接：mcf171的博客

——————————————————————————————

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 = 0;
    public int sumOfLeftLeaves(TreeNode root) {
        
        if(root != null){
            sumOfLeftLeaves(root.left);
            sumOfLeftLeaves(root.right);
            if(root.left != null && root.left.left == null && root.left.right == null) sum += root.left.val;
        }
        return sum; 
    }
}

这个没啥好说的。。 Your runtime beats 3.80% of java submissions.