learning
/
leetcode-master
mirror of https://github.com/youngyangyang04/leetcode-master.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #2513 from JasenChao/master 

Update 0494.目标和.md
This commit is contained in:
程序员Carl 2024-05-07 11:37:54 +08:00 committed by GitHub
parent 73f99045f2 7df5157aab
commit 3b6ac8b7b3
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -101,7 +101,7 @@ public:
int sum = 0; int sum = 0;
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) return 0; // 此时没有方案，两个int相加的时候要各位小心数值溢出的问题 if ((S + sum) % 2) return 0; // 此时没有方案，两个int相加的时候要格外小心数值溢出的问题
int bagSize = (S + sum) / 2; // 转变为组合总和问题，bagsize就是要求的和 int bagSize = (S + sum) / 2; // 转变为组合总和问题，bagsize就是要求的和
// 以下为回溯法代码 // 以下为回溯法代码