leetcode 113. Path Sum II Add to List

题目链接：https://leetcode.com/problems/path-sum-ii/#/description 

题目：

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

代码AC：

/**
 * Definition for a binary tree node.
 * 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<Integer> currentResult = new ArrayList<Integer>();
	   List<List<Integer>> result = new ArrayList<List<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(root.val);
	     if(root.left== null && root.right==null && root.val == sum){
	    	 result.add(new ArrayList(currentResult));
	    	 currentResult.remove(currentResult.size()-1);
	    	 return;
	     }
	     pathSum(root.left, sum-root.val, currentResult, result);
	     pathSum(root.right, sum-root.val, currentResult, result);
	     
	     currentResult.remove(currentResult.size()-1);
   }
}