mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-04 08:02:30 +08:00
修改494 dp解法,添加条件判断
This commit is contained in:
@ -6,7 +6,7 @@ func findTargetSumWays(nums []int, S int) int {
|
||||
for _, n := range nums {
|
||||
total += n
|
||||
}
|
||||
if S > total || (S+total)%2 == 1 || S+total < 0 {
|
||||
if S+total < 0 || S > total || (S+total)%2 == 1 {
|
||||
return 0
|
||||
}
|
||||
target := (S + total) / 2
|
||||
|
Reference in New Issue
Block a user