刷题小记 (5) LeetCode 404 左叶子之和

LeetCode 404

2020.8.13

我的通过代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public int sumOfLeftLeaves(TreeNode root) {
        if(root==null) return 0;
        List<Integer> list = new ArrayList<Integer>();
        traverse(root,list);
        int x = 0;
        for(int i=0;i<list.size();i++) {
            x+=list.get(i);
        }
        return x;
    }

    void traverse(TreeNode root,List<Integer> list) {
        if(root==null) return;
        if(root.left!=null&&root.left.left==null&&root.left.right==null) {
            list.add(root.left.val);
            traverse(root.right,list);
        } else {
            traverse(root.left,list);
            traverse(root.right,list);
        }
    }
}