LeetCode-Path Sum II

最新推荐文章于 2019-04-07 22:09:40 发布

数据探险家

最新推荐文章于 2019-04-07 22:09:40 发布

阅读量2k

点赞数

分类专栏： LeetCode OJ 文章标签： LeetCode

本文链接：https://blog.csdn.net/xin_jmail/article/details/39119407

版权

LeetCode OJ 专栏收录该内容

48 篇文章 0 订阅

订阅专栏

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

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

源码：Java版本
算法分析：时间复杂度O(n)，空间复杂度O(logn)。

/**
 * 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>> results=new ArrayList<List<Integer>>();
        Stack<Integer> path=new Stack<Integer>();
        pathSum(root,sum,path,results);
        return results;
    }
    
    private void pathSum(TreeNode root,int sum,Stack<Integer> path,List<List<Integer>> results) {
        if(root==null) {
            return;
        }
        path.push(root.val);
        if(root.left==null && root.right==null) {
            if(sum==root.val) {
                results.add((Stack<Integer>)(path.clone()));
            }
        }
        pathSum(root.left,sum-root.val,path,results);
        pathSum(root.right,sum-root.val,path,results);
        path.pop();
    }
}