class Solution:
def findTargetSumWays(self, nums: List[int], target: int) -> int:
index=len(nums)-1
curr_sum=0
self.nums=nums
self.target=target
return self.dp(index,curr_sum)
@cache
def dp(self,index,curr_sum):
if index<0:
if curr_sum==self.target:return 1
else:return 0
p=self.dp(index-1,curr_sum+self.nums[index])
n=self.dp(index-1,curr_sum-self.nums[index])
return p+n
注意不要把变量写错,target