404. Sum of Left Leaves#2(Done)

Solution#2

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
 // 递归
public class Solution {
    public int sumOfLeftLeaves(TreeNode root) {
        if (root == null || (root.left == null && root.right == null)) return 0;
        int result = 0;
        if (root.left != null) {
            if (root.left.left == null && root.left.right == null)
                result += root.left.val;
            else {
                result += sumOfLeftLeaves(root.left);
            }
        }
        if (root.right != null) {
            result += sumOfLeftLeaves(root.right);
        }
        return result;
    }
}

Solution#1

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
 // 迭代
public class Solution {
    public int sumOfLeftLeaves(TreeNode root) {
        if (root == null || (root.left == null && root.right == null)) return 0;
        Stack<TreeNode> stack = new Stack<>();
        stack.push(root);
        int result = 0;
        while(stack.size() != 0) {
            TreeNode tmp = stack.pop();
            if (tmp.right != null) {
                stack.push(tmp.right);
            }
            if (tmp.left != null) {
                if (tmp.left.left == null && tmp.left.right == null) result += tmp.left.val;
                else stack.push(tmp.left);
            }
        }
        return result;
    }
}

Problem#2

• 时间复杂度太高(26.2%)
• 代码不够简洁，减少几个不必要的判断条件后，时间提升至(75.96%)

Problem#1

• 时间复杂度太高(15.16%)