LeetCode 112&113 --Path Sum I & II;

最新推荐文章于 2024-09-18 11:04:20 发布

yiayia070614

最新推荐文章于 2024-09-18 11:04:20 发布

阅读量192

点赞数

分类专栏： leetcode 算法二叉树文章标签： leetcode 算法递归二叉树

本文链接：https://blog.csdn.net/yiayia070614/article/details/52503624

版权

leetcode 同时被 3 个专栏收录

20 篇文章 0 订阅

订阅专栏

算法

20 篇文章 0 订阅

订阅专栏

二叉树

2 篇文章 0 订阅

订阅专栏

Path Sum I

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example:
Given the below binary tree and sum = 22,

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \      \
        7    2      1

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

解法：简单运用递归方法进行解决，当一个节点没有子节点（为叶子），且从该节点到跟节点的和为sum.结束。

代码

<span style="font-size:14px;">/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean hasPathSum(TreeNode root, int sum) {
        if(root == null) return false;
         
        if(root.right == null && root.left == null && root.val == sum) return true;
        else return(hasPathSum(root.right, sum - root.val) || hasPathSum(root.left, sum - root.val));
    }
}</span>

Path Sum II

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example:
Given the below binary tree and sum = 22,

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \    / \
        7    2  5   1

return

[
   [5,4,11,2],
   [5,8,4,5]
]

解法：改题需要转换一下，再运用递归的方法。把所有符合的路径都添加到数组中。

<span style="font-size:14px;">/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<List<Integer>> pathSum(TreeNode root, int sum) {
        List<List<Integer>> res = new ArrayList<List<Integer>>();
        if(root == null) return res;
        
        List<Integer> cur = new ArrayList<Integer>();
        cur.add(root.val);
        helper(root, sum, res, cur);
        return res;
    }
    public void helper(TreeNode root, int sum, List<List<Integer>> res, List<Integer> cur){
        if(root == null) return;
        
        if(root.right == null && root.left == null && sum == root.val){
            res.add(new ArrayList<Integer>(cur));
            return;
        }
        if(root.left != null){
            cur.add(root.left.val);
            helper(root.left, sum - root.val, res, cur);
            cur.remove(cur.size() - 1);
        }
        if(root.right != null){
            cur.add(root.right.val);
            helper(root.right, sum - root.val, res, cur);
            cur.remove(cur.size() - 1);
        }
    }
}</span>