164 Maximum Gap.java

class Solution {
    public int maximumGap(int[] nums) {
        if(nums.length < 2) {
            return 0;
        }
        Arrays.sort(nums);
        int max = 0;
        for(int i = 1; i < nums.length; i++) {
            if(nums[i] - nums[i-1] > max) {
                max = nums[i] - nums[i-1];
            }
        }
        return max;
    }
}