題目:
解題思路:
一共迭代K次,每次都將最小的A[i]替換爲-A[i]即可。
python代碼:
from typing import List
class Solution:
def largestSumAfterKNegations(self, A: List[int], K: int) -> int:
for i in range(K):
A.sort()
A[0]=-A[0]
return sum(A)
A = [4,2,3]
K=1
so=Solution()
print(so.largestSumAfterKNegations(A,K))