#1005
Maximize Sum Of Array After K Negations
pupil · 425 · lc easy +25 · verified · 53.6% accepted · 1,705 likes · top 45%
Description
Given an integer array nums and an integer k, you must perform exactly k negation operations, where each operation picks an index i and replaces nums[i] with -nums[i]. The same index may be chosen multiple times.
Return the maximum possible array sum after all k operations.
Example 1:
Input: nums = [4,2,3], k = 1
Output: 5
Explanation: Choose index 1 and nums becomes [4,-2,3].
Example 2:
Input: nums = [3,-1,0,2], k = 3
Output: 6
Explanation: Choose indices (1, 2, 2) and nums becomes [3,1,0,2].
Example 3:
Input: nums = [2,-3,-1,5,-4], k = 2
Output: 13
Explanation: Choose indices (1, 4) and nums becomes [2,3,-1,5,4].
Code
1
2
3