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

修复1005.K取反后最大化的数组和Java代码K书写错误问题

Browse Source
This commit is contained in:
ironartisan
2021-08-29 10:58:53 +08:00
parent 1b1ccb1409
commit b4858a21cd
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -110,13 +110,13 @@ class Solution {
int len = nums.length; int len = nums.length;
for (int i = 0; i < len; i++) { for (int i = 0; i < len; i++) {
//从前向后遍历，遇到负数将其变为正数，同时K-- //从前向后遍历，遇到负数将其变为正数，同时K--
if (nums[i] < 0 && k > 0) { if (nums[i] < 0 && K > 0) {
nums[i] = -nums[i]; nums[i] = -nums[i];
k--; K--;
} }
} }
// 如果K还大于0，那么反复转变数值最小的元素，将K用完 // 如果K还大于0，那么反复转变数值最小的元素，将K用完
if (k % 2 == 1) nums[len - 1] = -nums[len - 1]; if (K % 2 == 1) nums[len - 1] = -nums[len - 1];
int result = 0; int result = 0;
for (int a : nums) { for (int a : nums) {
result += a; result += a;