给你一个整数数组 nums 和一个整数 target 。
向数组中的每个整数前添加 ‘+’ 或 ‘-’ ,然后串联起所有整数,可以构造一个 表达式 :
例如,nums = [2, 1] ,可以在 2 之前添加 '+' ,在 1 之前添加 '-' ,然后串联起来得到表达式 "+2-1" 。
返回可以通过上述方法构造的、运算结果等于 target 的不同 表达式 的数目。
示例 1:
输入:nums = [1,1,1,1,1], target = 3
输出:5
解释:一共有 5 种方法让最终目标和为 3 。
-1 + 1 + 1 + 1 + 1 = 3
+1 - 1 + 1 + 1 + 1 = 3
+1 + 1 - 1 + 1 + 1 = 3
+1 + 1 + 1 - 1 + 1 = 3
+1 + 1 + 1 + 1 - 1 = 3
示例 2:
输入:nums = [1], target = 1
输出:1
提示:
1 <= nums.length <= 20
0 <= nums[i] <= 1000
0 <= sum(nums[i]) <= 1000
-1000 <= target <= 1000
思路:动态规划
傻逼行为的第一次操作:
结果:时间不通过
class Solution:
def findTargetSumWays(self, nums: List[int], target: int) -> int:
dp = [[] for _ in nums]
dp[0] = [-nums[0],nums[0]]
for i in range(1,len(nums)):
# nums[i],-nums[i]
for j in range(len(dp[i-1])):
current = dp[i-1][j] + nums[i]
dp[i].append(current)
#if(current not in dp[i]):dp[i].append(current)
#elif(i == len(nums)-1):dp[i].append(current)
for j in range(len(dp[i-1])):
current = dp[i-1][j] - nums[i]
dp[i].append(current)
#if(current not in dp[i]):dp[i].append(current)
#elif(i == len(nums)-1):dp[i].append(current)
m = 0
for _ in dp[-1]:
if(_ == target):
m += 1
return m
优化
注释有个地方:会的告诉我
# 不知道如何把这里写的好看一点,有没有会的教教我
class Solution:
def findTargetSumWays(self, nums: List[int], target: int) -> int:
dp = [{} for _ in nums]
dp[0][-nums[0]]=1
if(nums[0] in dp[0]):dp[0][nums[0]]+=1
else:dp[0][nums[0]]=1
for i in range(1,len(nums)):
for dpValue in dp[i-1]:
current = dpValue + nums[i]
if(current in dp[i]):dp[i][current]+=dp[i-1][dpValue]
else:dp[i][current]=dp[i-1][dpValue]
current = dpValue - nums[i] # 不知道如何把这里写的好看一点,有没有会的教教我
if(current in dp[i]):dp[i][current]+=dp[i-1][dpValue]
else:dp[i][current]=dp[i-1][dpValue]
try:
return dp[-1][target]
except:
return 0