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

/**
 * 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>> result  = new LinkedList<List<Integer>>();
        List<Integer> currentResult  = new LinkedList<Integer>();
        pathSum(root,sum,currentResult,result);
        return result;
        
    }
    public void pathSum(TreeNode root, int sum, List<Integer> currentResult,
        List<List<Integer>> result) {
    if (root == null||sum<0)
        return;
    currentResult.add(new Integer(root.val));
    if (root.left == null && root.right == null && sum == root.val) {
        result.add(new LinkedList(currentResult));
        currentResult.remove(currentResult.size() - 1);
        return;
    } else {
        pathSum(root.left, sum - root.val, currentResult, result);
        pathSum(root.right, sum - root.val, currentResult, result);
        
    }
    currentResult.remove(currentResult.size() - 1);
            
    }
}

刚开始自作聪明的加上了递归终结的条件 sum<0;结果直接死在了这个测试案列上：

Submission Result: Wrong AnswerMore Details 

Input:	{-2,#,-3}, -5
Output:	[]
Expected:	[[-2,-3]]

还是思考的时候不严谨，忽略了负数，也应该是第一印象的问题，我记得见过一道题就是加上sum判断优化算法，这样就不用遍历每条路径到叶子，

所以对这个题没认真思考啊，没判断到还有负数的情况。然后正确的代码应该如下：去掉sum<0即可：

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