class Solution {
int count = 0;
public int findTargetSumWays(int[] nums, int target) {
backTrack(nums,target,0,0);
return count;
}
public void backTrack(int[] nums,int target,int sum,int index){
if(index == nums.length){
if(sum == target){
count++;
}
}
else{
backTrack(nums,target,sum + nums[index],index+1);
backTrack(nums,target,sum - nums[index],index+1);
}
}
}
如果递归时index+1改成index++就会溢出,猜想这里传的index一直是引用,是同一个index,可能这样说不准确