34. 二叉树中和为某一值的路径(pathSum)

赵敏丫头

于 2021-03-09 11:03:03 发布

阅读量97

点赞数

分类专栏： Algorithm_swordOffer

本文链接：https://blog.csdn.net/weixin_44294385/article/details/114578203

版权

Algorithm_swordOffer 专栏收录该内容

37 篇文章 1 订阅

订阅专栏

34. 二叉树中和为某一值的路径(pathSum)

1. python

class Solution:
    def __init__(self):
        self.ret,self.path=[],[]
    def pathSum(self, root: TreeNode, sum: int) -> List[List[int]]:
        if not root:
            return[]
        self.path.append(root.val)
        sum = sum - root.val
        if sum ==0 and not root.left and not root.right:
            self.ret.append(list(self.path))
        self.pathSum(root.left,sum) 
        self.pathSum(root.right,sum)
        self.path.pop()
        return self.ret

2. Java

class Solution {
    LinkedList<List<Integer>> ret = new LinkedList<List<Integer>>();
    LinkedList<Integer> path = new LinkedList<Integer>();
    public List<List<Integer>> pathSum(TreeNode root, int sum) {
        recur(root,sum);
        return ret;
    }
    void recur(TreeNode root,int sum){
        if(root == null){
            return;
        }
        path.add(root.val);
        sum = sum -root.val;
        if (0== sum && root.left== null && root.right==null){
            ret.add(new LinkedList(path));
        }
        recur(root.left,sum);
        recur(root.right,sum);
        path.removeLast();
    }