LeetCode 113 Path Sum II (DFS)

最新推荐文章于 2024-09-20 15:28:15 发布

_TCgogogo_

最新推荐文章于 2024-09-20 15:28:15 发布

阅读量767

点赞数

分类专栏： Leetcode Medium LeetCode 文章标签： leetcode DFS

本文链接：https://blog.csdn.net/Tc_To_Top/article/details/52366247

版权

LeetCode 同时被 2 个专栏收录

334 篇文章 5 订阅

订阅专栏

Leetcode Medium

244 篇文章 0 订阅

订阅专栏

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]
]

题目链接：https://leetcode.com/problems/path-sum-ii/

题目分析：直接DFS即可，到叶子节点时判断

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    
    public void DFS(int curSum, int sum, TreeNode root, List<Integer> cur, List<List<Integer>> ans) {
        if(root == null) {
            return;
        }
        if(root != null && (root.left == null && root.right == null)) {
            if(curSum + root.val == sum) {
                cur.add(root.val);
                ans.add(new ArrayList<Integer>(cur));
                cur.remove(cur.size() - 1);
            }
            return;
        }
        cur.add(root.val);
        DFS(curSum + root.val, sum, root.left, cur, ans);
        DFS(curSum + root.val, sum, root.right, cur, ans);
        cur.remove(cur.size() - 1);
    }
    
    public List<List<Integer>> pathSum(TreeNode root, int sum) {
        List<List<Integer>> ans = new ArrayList<>();
        List<Integer> cur = new ArrayList<>();
        DFS(0, sum, root, cur, ans);
        return ans;
    }
}