@@ -0,0 +1,385 @@
+/**%0A * #164%0A * url: https://leetcode.com/problems/maximum-gap/%0A */%0A%0Aclass Solution %7B%0A    public int maximumGap(int%5B%5D nums) %7B%0A        if (nums.length %3C 2) return 0;%0A        Arrays.sort(nums);%0A%0A        int max = 0;%0A        for (int i = 0; i %3C nums.length - 1; i++) %7B%0A            int gap = nums%5Bi + 1%5D - nums%5Bi%5D;%0A            if (gap %3E max) max = gap;%0A        %7D%0A        return max;%0A    %7D%0A%7D

164 Maximum Gap