路径和（根节点到叶节点）Path Sum II

最新推荐文章于 2020-11-11 21:55:19 发布

weixin_34361881

最新推荐文章于 2020-11-11 21:55:19 发布

阅读量129

点赞数

原文链接：https://my.oschina.net/liyurong/blog/1539981

版权

为什么80%的码农都做不了架构师？>>>

问题：

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

解决：

① dfs解决。

/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution { //2ms
public List<List<Integer>> pathSum(TreeNode root, int sum) {
List<List<Integer>> res = new ArrayList<>();
List<Integer> list = new ArrayList<>();
dfs(root,sum,list,res);
return res;
}
public void dfs(TreeNode root,int sum,List<Integer> list,List<List<Integer>> res){
if(root == null) return;
list.add(root.val);
if(sum == root.val && root.left == null && root.right == null){
res.add(new ArrayList<Integer>(list));
}
dfs(root.left,sum - root.val,list,res);
dfs(root.right,sum - root.val,list,res);
list.remove(list.size() - 1);
}
}

② 非递归方法。

public class Solution { //7ms
public List<List<Integer>> pathSum(TreeNode root, int sum) {
List<List<Integer>> res = new ArrayList<>();
List<Integer> list = new ArrayList<>();
Stack<TreeNode> stack = new Stack<TreeNode>();
int curSum = 0;
TreeNode cur = root;
TreeNode pre = null;
while(cur != null || !stack.isEmpty()){
while(cur != null){
stack.push(cur);
list.add(cur.val);
curSum += cur.val;
cur = cur.left;
}
cur = stack.peek();
if(cur.right != null && cur.right != pre){
cur = cur.right;
continue;
}
if(cur.left == null && cur.right == null && curSum == sum)
res.add(new ArrayList<Integer>(list));
pre = cur;
stack.pop();
list.remove(list.size() - 1);
curSum -= cur.val;
cur = null;
}
return res;
}
}