第19天|513.找树左下角的值，112. 路径总和 113.路径总和ii

最新推荐文章于 2024-10-02 23:40:03 发布

sanshui013

最新推荐文章于 2024-10-02 23:40:03 发布

阅读量206

点赞数 3

文章标签：算法

本文链接：https://blog.csdn.net/sanshui013/article/details/136451286

版权

513.找树左下角的值

. - 力扣（LeetCode）

/**
 * 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) {
          Deque<TreeNode> d = new ArrayDeque<>();
        d.addLast(root);
        int ans = 0;
        while (!d.isEmpty()) {
            int sz = d.size();
            ans = d.peek().val;
            while (sz-- > 0) {
                TreeNode poll = d.pollFirst();
                if (poll.left != null) d.addLast(poll.left);
                if (poll.right != null) d.addLast(poll.right);
            }
        }
        return ans;

    }
}

112. 路径总和

. - 力扣（LeetCode）

/**
 * 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 boolean hasPathSum(TreeNode root, int targetSum) {
        if(root == null ){
            return false;
        }

        if(root.left == null && root.right ==null){
             return targetSum == root.val;
        }
         return hasPathSum(root.left, targetSum - root.val) || hasPathSum(root.right, targetSum - root.val);

    }
}

113.路径总和ii

. - 力扣（LeetCode）

/**
 * 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 {
     LinkedList<List<Integer>> res = new LinkedList<>();
    LinkedList<Integer> path = new LinkedList<>();
    public List<List<Integer>> pathSum(TreeNode root, int targetSum) {

        recur(root,targetSum);
        return res;
    }

    void recur(TreeNode root , int tar){
        if(root == null ){
            return;
        }
        path.add(root.val);
        tar -= root.val;

        if(tar==0&&root.left==null&&root.right==null){
            res.add(new LinkedList<Integer> (path));
        }
        recur(root.left, tar);
        recur(root.right, tar);
         path.removeLast();
    }
}