algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-06 17:44:10 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新 problem 1005

Browse Source
This commit is contained in:
YDZ
2019-06-24 08:53:47 +08:00
parent 8038b023b2
commit 270ff26ad0
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

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