113. Path Sum II**

最新推荐文章于 2019-07-22 00:04:14 发布

Yingying_code

最新推荐文章于 2019-07-22 00:04:14 发布

阅读量243

点赞数

分类专栏： leetcode Java backtracking Tree

本文链接：https://blog.csdn.net/alwaystry/article/details/54932945

版权

leetcode 同时被 3 个专栏收录

261 篇文章 0 订阅

订阅专栏

Java

188 篇文章 0 订阅

订阅专栏

Tree

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

public class Solution {
    public List<List<Integer>> pathSum(TreeNode root, int sum) {
        List<List<Integer>> result = new ArrayList<List<Integer>>();
        if(root==null) return result;
        backtrack(result, new ArrayList<Integer>(), root,sum);
        return result;
    }
    private void backtrack(List<List<Integer>> list, List<Integer> templist, TreeNode root, int sum){
        if(root==null) return;
        templist.add(root.val);
        if(root.left==null&&root.right==null&&root.val==sum) 
           {
               list.add(new ArrayList(templist));
               
           }
        else{
            backtrack(list,templist,root.left,sum-root.val);
            backtrack(list,templist,root.right,sum-root.val);
        }
        templist.remove(templist.size()-1);
    }
}

总结：backtrack