MaximumGap.java

package by.andd3dfx.common;

import java.util.Arrays;

/**
 * <pre>
 * <a href="https://leetcode.com/problems/maximum-gap/description/">Task description</a>
 *
 * Given an integer array nums, return the maximum difference between two successive elements in its sorted form.
 * If the array contains less than two elements, return 0.
 * You must write an algorithm that runs in linear time and uses linear extra space.
 *
 * Example 1:
 *   Input: nums = [3,6,9,1]
 *   Output: 3
 *   Explanation: The sorted form of the array is [1,3,6,9], either (3,6) or (6,9) has the maximum difference 3.
 *
 * Example 2:
 *   Input: nums = [10]
 *   Output: 0
 *   Explanation: The array contains less than 2 elements, therefore return 0.
 * </pre>
 */
public class MaximumGap {

    public static int determine(int[] nums) {
        if (nums.length < 2) {
            return 0;
        }

        Arrays.sort(nums);

        int result = 0;
        for (int i = 1; i < nums.length; i++) {
            var diff = nums[i] - nums[i - 1];
            if (diff > result) {
                result = diff;
            }
        }
        return result;
    }
}