algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-11 13:00:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix 0494

Browse Source
This commit is contained in:
yqq
2021-08-21 18:00:54 +08:00
parent 542482fa5f
commit 34444b3a4d
1 changed files with 10 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
problems/0494.目标和.md
View File

@ -19,15 +19,15 @@
示例： 示例：
输入：nums: [1, 1, 1, 1, 1], S: 3 输入：nums: [1, 1, 1, 1, 1], S: 3
输出：5 输出：5
解释： 解释：
-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 +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
一共有5种方法让最终目标和为3。 一共有5种方法让最终目标和为3。
@ -202,6 +202,7 @@ public:
for (int i = 0; i < nums.size(); i++) sum += nums[i]; for (int i = 0; i < nums.size(); i++) sum += nums[i];
if (S > sum) return 0; // 此时没有方案 if (S > sum) return 0; // 此时没有方案
if ((S + sum) % 2 == 1) return 0; // 此时没有方案 if ((S + sum) % 2 == 1) return 0; // 此时没有方案
if (S + sum < 0) return 0; // 以确保bagSize为正数
int bagSize = (S + sum) / 2; int bagSize = (S + sum) / 2;
vector<int> dp(bagSize + 1, 0); vector<int> dp(bagSize + 1, 0);
dp[0] = 1; dp[0] = 1;
@ -311,7 +312,7 @@ Javascript：
const findTargetSumWays = (nums, target) => { const findTargetSumWays = (nums, target) => {
const sum = nums.reduce((a, b) => a+b); const sum = nums.reduce((a, b) => a+b);
if(target > sum) { if(target > sum) {
return 0; return 0;
} }