算法记录 leetcode 113遇到的问题

leetcode 113 路径总和

遇到的问题：

用path来存储路径的时候，如果运行类型为ArrayList，结果会出错，但是如果运行类型改为LinkedList，则结果正确

目前尚未解决，记录一下

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<List<Integer>> pathSum(TreeNode root, int targetSum) {
        List<List<Integer>> result = new ArrayList<>();
        if (root == null) {
            return result;
        }
        List<Integer> path = new LinkedList<>();
        // List<Integer> path = new ArrayList<>();
        traversal(root,targetSum,result,path);
        return result;
    }

    public void traversal(TreeNode root,int targetSum,List<List<Integer>> result,List<Integer> path) {
        path.add(root.val);
        if (root.left == null && root.right == null) {
            if (targetSum - root.val == 0) {
                result.add(new ArrayList<>(path));
                // result.add(path);
            }
            return;
        }
        if (root.left != null) {
            traversal(root.left,targetSum-root.val,result,path);
            path.remove(path.size()-1);
        }
        if (root.right != null) {
            traversal(root.right,targetSum-root.val,result,path);
            path.remove(path.size()-1);
        }
    }
}