更新 problem 1005

Author: halfrost

Algorithms/1005. Maximize Sum Of Array After K Negations/1005. Maximize Sum Of Array After K Negations.go

@@ -1,13 +1,15 @@
 package leetcode
 
-import "sort"
+import (
+	"sort"
+)
 
 func largestSumAfterKNegations(A []int, K int) int {
 	sort.Ints(A)
 	minIdx := 0
 	for i := 0; i < K; i++ {
 		A[minIdx] = -A[minIdx]
-		if minIdx == len(A)-1 || A[minIdx+1] < A[minIdx] {
+		if A[minIdx+1] < A[minIdx] {
 			minIdx++
 		}
 	}