题目链接:https://leetcode.com/problems/path-sum-ii/
题目千变万化,但都是一样的套路。开一个足够大的数组来存储某条可能路径经过的节点的值,如果到达叶节点就判断一下是否路径和等于目标值,如果等于就保存在全局变量ret中,然后返回,so easy!!!
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public static int[] record;
public static List<List<Integer>> ret;
public List<List<Integer>> pathSum(TreeNode root, int sum) {
record=new int[100000];
ret=new LinkedList<>();
if(root==null)
return ret;
recursion(root,0,sum);
return ret;
}
public static void recursion(TreeNode node,int idx,int sum)
{
if(node!=null && node.left==null && node.right==null)
{
if(sum==node.val)
{
LinkedList<Integer> tmp=new LinkedList<>();
for(int i=0;i<idx;i++)
tmp.add(record[i]);
tmp.add(node.val);
ret.add(tmp);
}
return;
}
record[idx]=node.val;
if(node.left!=null)
recursion(node.left,idx+1,sum-node.val);
if(node.right!=null)
recursion(node.right,idx+1,sum-node.val);
return;
}
}