Package g1501_1600.s1509_minimum_difference_between_largest_and_smallest_value_in_three_moves

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1509 - Minimum Difference Between Largest and Smallest Value in Three Moves.

    Medium

    You are given an integer array nums. In one move, you can choose one element of nums and change it by any value.

    Return the minimum difference between the largest and smallest value of nums after performing at most three moves.

    Example 1:

    Input: nums = 5,3,2,4

    Output: 0

    Explanation: Change the array 5,3,2,4 to **2** , **2** ,2, **2** . The difference between the maximum and minimum is 2-2 = 0.

    Example 2:

    Input: nums = 1,5,0,10,14

    Output: 1

    Explanation: Change the array 1,5,0,10,14 to 1, **1** ,0, **1** , **1** . The difference between the maximum and minimum is 1-0 = 1.

    Constraints:

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

    • <code>-10<sup>9</sup><= numsi<= 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