From b4858a21cdf7a154e84fd3825b031740a7a6db08 Mon Sep 17 00:00:00 2001
From: ironartisan <ironerhalo@gmail.com>
Date: Sun, 29 Aug 2021 10:58:53 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BF=AE=E5=A4=8D1005.K=E5=8F=96=E5=8F=8D?=
 =?UTF-8?q?=E5=90=8E=E6=9C=80=E5=A4=A7=E5=8C=96=E7=9A=84=E6=95=B0=E7=BB=84?=
 =?UTF-8?q?=E5=92=8CJava=E4=BB=A3=E7=A0=81K=E4=B9=A6=E5=86=99=E9=94=99?=
 =?UTF-8?q?=E8=AF=AF=E9=97=AE=E9=A2=98?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/1005.K次取反后最大化的数组和.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/problems/1005.K次取反后最大化的数组和.md b/problems/1005.K次取反后最大化的数组和.md
index 8bdd0f41..b9973b5f 100644
--- a/problems/1005.K次取反后最大化的数组和.md
+++ b/problems/1005.K次取反后最大化的数组和.md
@@ -110,13 +110,13 @@ class Solution {
 	int len = nums.length;	    
 	for (int i = 0; i < len; i++) {
 	    //从前向后遍历，遇到负数将其变为正数，同时K--
-	    if (nums[i] < 0 && k > 0) {
+	    if (nums[i] < 0 && K > 0) {
 	    	nums[i] = -nums[i];
-		k--;
+            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;
 	for (int a : nums) {
 	    result += a;