update

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

@@ -130,29 +130,6 @@ class Solution {
 }
 ```
 
-```java
-class Solution {
-    public int largestSumAfterKNegations(int[] A, int K) {
-        if (A.length == 1) return k % 2 == 0 ? A[0] : -A[0];
-        Arrays.sort(A);
-        int sum = 0;
-        int idx = 0;
-        for (int i = 0; i < K; i++) {
-            if (i < A.length - 1 && A[idx] < 0) {
-                A[idx] = -A[idx];
-                if (A[idx] >= Math.abs(A[idx + 1])) idx++;
-                continue;
-            }
-            A[idx] = -A[idx];
-        }
-
-        for (int i = 0; i < A.length; i++) {
-            sum += A[i];
-        }
-        return sum;
-    }
-}
-```
 
 ### Python
 ```python