From 9aaf02cc20156d385853f0d3f8c9eebc983bc9d7 Mon Sep 17 00:00:00 2001
From: sharky <1821984081@qq.com>
Date: Tue, 18 Apr 2023 15:15:28 +0800
Subject: [PATCH] =?UTF-8?q?1005=E3=80=81K=E6=AC=A1=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=8C=EF=BC=8C=E6=9A=B4=E5=8A=9B=E8=A7=A3=E6=B3=95=EF=BC=8C?=
 =?UTF-8?q?java?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../1005.K次取反后最大化的数组和.md | 18 +++++++++++++++++-
 1 file changed, 17 insertions(+), 1 deletion(-)

diff --git a/problems/1005.K次取反后最大化的数组和.md b/problems/1005.K次取反后最大化的数组和.md
index cdf42511..18b07b89 100644
--- a/problems/1005.K次取反后最大化的数组和.md
+++ b/problems/1005.K次取反后最大化的数组和.md
@@ -145,7 +145,23 @@ class Solution {
     }
 }
 ```
-
+```java
+//暴力解法
+class Solution {
+    public int largestSumAfterKNegations(int[] nums, int k) {
+        int count = 0;
+        //循环k次
+        for( int i = 0; i < k; i++ ){
+           Arrays.sort( nums );
+           nums[0] = -nums[0];//把最小值换成其相反数
+        }
+        for ( int num : nums ){
+            count += num;//累加
+        }
+        return count;
+    }
+}
+```
 ### Python
 ```python
 class Solution: