Package g3301_3400.s3357_minimize_the_maximum_adjacent_element_difference

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3357 - Minimize the Maximum Adjacent Element Difference.

    Hard

    You are given an array of integers nums. Some values in nums are missing and are denoted by -1.

    You can choose a pair of positive integers (x, y) exactly once and replace each missing element with either x or y.

    You need to minimize the maximum absolute difference between adjacent elements of nums after replacements.

    Return the minimum possible difference.

    Example 1:

    Input: nums = 1,2,-1,10,8

    Output: 4

    Explanation:

    By choosing the pair as (6, 7), nums can be changed to [1, 2, 6, 10, 8].

    The absolute differences between adjacent elements are:

    • |1 - 2| == 1

    • |2 - 6| == 4

    • |6 - 10| == 4

    • |10 - 8| == 2

    Example 2:

    Input: nums = -1,-1,-1

    Output: 0

    Explanation:

    By choosing the pair as (4, 4), nums can be changed to [4, 4, 4].

    Example 3:

    Input: nums = -1,10,-1,8

    Output: 1

    Explanation:

    By choosing the pair as (11, 9), nums can be changed to [11, 10, 9, 8].

    Constraints:

    • <code>2 <= nums.length <= 10<sup>5</sup></code>

    • nums[i] is either -1 or in the range <code>1, 10<sup>9</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 minDifference(IntArray nums)

      • Methods inherited from class java.lang.Object

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