Package g1001_1100.s1005_maximize_sum_of_array_after_k_negations

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1005 - Maximize Sum Of Array After K Negations.

    Easy

    Given an integer array nums and an integer k, modify the array in the following way:

    • choose an index i and replace nums[i] with -nums[i].

    You should apply this process exactly k times. You may choose the same index i multiple times.

    Return the largest possible sum of the array after modifying it in this way.

    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.

    Constraints:

    • <code>1 <= nums.length <= 10<sup>4</sup></code>

    • -100 &lt;= nums[i] &lt;= 100

    • <code>1 <= k <= 10<sup>4</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer largestSumAfterKNegations(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait