力扣算法学习day13-3

力扣算法学习day13-3

404-左叶子之和

题目

代码实现

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    // 方法一：使用静态量计数，迭代直接在遍历的基础上在左结点遍历上加上一个判断。
    // static int sum = 0;
    // public int sumOfLeftLeaves(TreeNode root) {
    //     leftSum(root);
    //     int x = sum;
    //     sum = 0;
    //     return x;
    // }
    // public void leftSum(TreeNode node){
    //     if(node.left != null){
    //         if(node.left.left == null && node.left.right == null){
    //             sum += node.left.val;
    //         }
    //         leftSum(node.left);
    //     }
    //     if(node.right != null){
    //         leftSum(node.right);
    //     }
    // }

    // 方法二：常规递归,后序遍历
    public int sumOfLeftLeaves(TreeNode root) {
        if(root == null){
            return 0;
        }
        int leftValue = sumOfLeftLeaves(root.left);
        int rightValue = sumOfLeftLeaves(root.right);
        int midValue = 0;

        if(root.left != null && root.left.left == null && root.left.right == null){
            midValue = root.left.val;
        }

        return leftValue + rightValue + midValue;
    }
    
}

513-找树左下角的值

题目

代码实现

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int findBottomLeftValue(TreeNode root) {
        LinkedList<TreeNode> queue = new LinkedList<>();
        ArrayList<Integer> list = new ArrayList<>();

        queue.offer(root);
        while(!queue.isEmpty()){
            int len = queue.size();
            int index = len;

            while(len > 0){
                TreeNode node = queue.poll();
                if(index == len){
                    list.add(node.val);
                }

                if(node.left != null){
                    queue.offer(node.left);
                }
                if(node.right != null){
                    queue.offer(node.right);
                }
                len--;
            }
        }
        int val = list.get(list.size() - 1);
        return val;
    }
}