LeetCode Solutions
class Solution {
public:
int largestSumAfterKNegations(vector<int>& A, int K) {
sort(begin(A), end(A));
for (int i = 0; i < A.size(); ++i) {
if (A[i] > 0 || K == 0)
break;
A[i] = -A[i];
--K;
}
return accumulate(begin(A), end(A), 0) -
(K % 2) * *min_element(begin(A), end(A)) * 2;
}
};
|
class Solution:
def largestSumAfterKNegations(self, A: List[int], K: int) -> int:
A.sort()
for i in range(len(A)):
if A[i] > 0 or K == 0:
break
A[i] = -A[i]
K -= 1
return sum(A) - (K % 2) * min(A) * 2
|
