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

Update 0494.目标和.md

Browse Source
This commit is contained in:
程序员Carl
2022-07-21 09:37:53 +08:00
committed by GitHub
parent 2d9727d620
commit e108c87570
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -213,7 +213,7 @@ public:
if (abs(S) > sum) return 0; // 此时没有方案 if (abs(S) > sum) return 0; // 此时没有方案
if ((S + sum) % 2 == 1) return 0; // 此时没有方案 if ((S + sum) % 2 == 1) return 0; // 此时没有方案
int bagSize = (S + sum) / 2; int bagSize = (S + sum) / 2;
if(bagsize<0) return 0; if (bagsize < 0) return 0;
vector<int> dp(bagSize + 1, 0); vector<int> dp(bagSize + 1, 0);
dp[0] = 1; dp[0] = 1;
for (int i = 0; i < nums.size(); i++) { for (int i = 0; i < nums.size(); i++) {