题目描述
https://leetcode-cn.com/problems/target-sum/
思路题解
dp[i][j]
代表以i结尾的等于j的情况的个数。
dp[i][j]=dp[i-1][j-nums[i]]+dp[i-1][j+nums[i]]
因为target的正负不影响条件,即target=x和-x的结果一样的,因此j-nums[i]可以取绝对值。
最后注意边界情况,当nums[0]=0且j=0
时,dp[0][0]=2,而不是1.因为+0,-0都是0
class Solution:
def findTargetSumWays(self, nums: List[int], target: int) -> int:
if target>sum(nums) or target<sum(nums)*(-1):return 0
dp=[[0]*(sum(nums)+2) for _ in range(len(nums))]
dp[0][nums[0]]=1 if nums[0]!=0 else 2
for i in range(1,len(nums)):
for j in range(sum(nums)+1):
if abs(j-nums[i])<=sum(nums):
if j+nums[i]<=sum(nums):
dp[i][j]=dp[i-1][abs(j-nums[i])]+dp[i-1][j+nums[i]]
else:dp[i][j]=dp[i-1][abs(j-nums[i])]
# for i in dp:
# print(i)
return dp[len(nums)-1][abs(target)]