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

Update 1005.K次取反后最大化的数组和.md

Browse Source 
保持Java代码的一致性，使用stream api来返回累加结果。
This commit is contained in:
hailincai
2021-08-29 07:37:38 -04:00
committed by GitHub
parent a7d3ab675a
commit 15ca61a880
1 changed files with 2 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
problems/1005.K次取反后最大化的数组和.md
View File

@ -117,11 +117,8 @@ class Solution {
}
// 如果K还大于0，那么反复转变数值最小的元素，将K用完
if (k % 2 == 1) nums[len - 1] = -nums[len - 1];
int result = 0;
for (int a : nums) {
result += a;
}
return result;
return Arrays.stream(nums).sum();
}
}
```