Path Sum II

最新推荐文章于 2018-12-11 19:36:09 发布

cgdong2014

最新推荐文章于 2018-12-11 19:36:09 发布

阅读量218

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/cgdong2014/article/details/39664611

版权

LeetCode 专栏收录该内容

139 篇文章 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]
]

思路：利用recursion 来一步步向下查询。 DFS
易错点：要判断是不是叶子root.left == null && root.right == null && cur == sum 才能加入，加完别忘记删除最后一个节点，每个节点用完别忘删除。

/**
 * Definition for binary tree
 * 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>> ret = new ArrayList<List<Integer>>();
        List<Integer> sol = new ArrayList<Integer>();
        addSum(root, 0, sum, sol, ret);
        return ret;
    }
    
    private void addSum(TreeNode root, int cur, int sum, List<Integer> sol, List<List<Integer>> ret){
        if(root == null){
            return;
        }
        cur += root.val;
        sol.add(root.val);
        if(root.left == null && root.right == null && cur == sum){
            ret.add(new ArrayList(sol));
            sol.remove(sol.size() - 1);//---------
            return;
        }
        addSum(root.left, cur, sum, sol, ret);
        addSum(root.right, cur, sum , sol, ret);
        sol.remove(sol.size() - 1);//-------------
    }
}