LeetCode113. Path Sum II（java）

• 问题描述

Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.

Note: A leaf is a node with no children.

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

• 解决方案

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<List<Integer>> pathSum(TreeNode root, int sum) {
        LinkedList<Integer> list = new LinkedList<>();
        List<List<Integer>> result = new ArrayList<List<Integer>>();
        findPath(root,sum,0,list,result);
        return result;
    }
    
    public void findPath(TreeNode root,int sum,int curSum,LinkedList<Integer> list,List<List<Integer>> result){
        if(root == null)
            return;
        list.add(root.val);
        curSum += root.val;
        if(root.left == null && root.right == null && sum == curSum){
             result.add(new LinkedList<>(list));
        }
        findPath(root.left,sum,curSum,list,result);
        findPath(root.right,sum,curSum,list,result);
        curSum -= root.val;
        list.pollLast();
    }
}