algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-06 01:15:57 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #169 from zhufenggood/master

Browse Source 
Update solution 0494.   Considering new edge test case.
This commit is contained in:
halfrost
2021-08-24 21:21:21 +08:00
committed by halfrost
parent 2189396c54 a3f55d9560
commit 2e628eb33d
2 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/0494.Target-Sum/494. Target Sum.go
View File

@ -6,7 +6,7 @@ func findTargetSumWays(nums []int, S int) int {
for _, n := range nums { for _, n := range nums {
total += n total += n
} }
if S > total || (S+total)%2 == 1 { if S > total || (S+total)%2 == 1 || S+total < 0 {
return 0 return 0
} }
target := (S + total) / 2 target := (S + total) / 2

4
leetcode/0494.Target-Sum/README.md
View File

@ -52,7 +52,7 @@ There are 5 ways to assign symbols to make the sum of nums be target 3.
等号两边都加上 `sum(N) + sum(P)`，于是可以得到结果 `2 * sum(P) = target + sum(nums)`，那么这道题就转换成了，能否在数组中找到这样一个集合，和等于 `(target + sum(nums)) / 2`。那么这题就转化为了第 416 题了。`dp[i]` 中存储的是能使和为 `i` 的方法个数。 等号两边都加上 `sum(N) + sum(P)`，于是可以得到结果 `2 * sum(P) = target + sum(nums)`，那么这道题就转换成了，能否在数组中找到这样一个集合，和等于 `(target + sum(nums)) / 2`。那么这题就转化为了第 416 题了。`dp[i]` 中存储的是能使和为 `i` 的方法个数。
- 如果和不是偶数，即不能被 2 整除，那说明找不到满足题目要求的解了，直接输出 0 。 - 如果和不是偶数，即不能被 2 整除，或者和是负数，那说明找不到满足题目要求的解了，直接输出 0 。
## 代码 ## 代码
@ -63,7 +63,7 @@ func findTargetSumWays(nums []int, S int) int {
for _, n := range nums { for _, n := range nums {
total += n total += n
} }
if S > total || (S+total)%2 == 1 { if S > total || (S+total)%2 == 1 || S+total < 0 {
return 0 return 0
} }
target := (S + total) / 2 target := (S + total) / 2