Package g1301_1400.s1330_reverse_subarray_to_maximize_array_value

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1330 - Reverse Subarray To Maximize Array Value\.

    Hard

    You are given an integer array nums. The value of this array is defined as the sum of |nums[i] - nums[i + 1]| for all 0 <= i < nums.length - 1.

    You are allowed to select any subarray of the given array and reverse it. You can perform this operation only once.

    Find maximum possible value of the final array.

    Example 1:

    Input: nums = 2,3,1,5,4

    Output: 10

    Explanation: By reversing the subarray 3,1,5 the array becomes 2,5,1,3,4 whose value is 10.

    Example 2:

    Input: nums = 2,4,9,24,2,1,10

    Output: 68

    Constraints:

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

    • <code>-10<sup>5</sup><= numsi<= 10<sup>5</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 maxValueAfterReverse(IntArray nums)

      • Methods inherited from class java.lang.Object

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