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

Update 0494.目标和.md

Browse Source 
java代码部分无法通过leetcode提交,需要先判断sum是否可以满足target
This commit is contained in:
picassoboss
2022-12-30 14:12:01 +08:00
committed by GitHub
parent f2e525df5a
commit e7f3ecc58a
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -270,6 +270,8 @@ class Solution {
public int findTargetSumWays(int[] nums, int target) { public int findTargetSumWays(int[] nums, int target) {
int sum = 0; int sum = 0;
for (int i = 0; i < nums.length; i++) sum += nums[i]; for (int i = 0; i < nums.length; i++) sum += nums[i];
//如果target过大 sum将无法满足
if ( target < 0 && sum < -target) return 0;
if ((target + sum) % 2 != 0) return 0; if ((target + sum) % 2 != 0) return 0;
int size = (target + sum) / 2; int size = (target + sum) / 2;
if(size < 0) size = -size; if(size < 0) size = -size;