Given an unsorted array, find the maximum difference between the successive elements in its sorted form.
Try to solve it in linear time/space.
Return 0 if the array contains less than 2 elements.
You may assume all elements in the array are non-negative integers and fit in the 32-bit signed integer range.
Credits:
Special thanks to @porker2008 for adding this problem and creating all test cases.
public class Solution {
public int maximumGap(int[] num) {
if (num.length < 2) return 0;
int min = num[0], max = num[0];
for (int i : num) {
min = Math.min(min, i);
max = Math.max(max, i);
}
int len = (max - min)/num.length + 1;
boolean[] flag = new boolean[(max - min)/len + 1];
int[][] bucket = new int[(max-min)/len + 1][2];
for (int x : num) {
int i = (x-min)/len;
if (flag[i] == false) {
flag[i] = true;
bucket[i][0] = x;
bucket[i][1] = x;
} else {
bucket[i][0] = Math.min(bucket[i][0], x);
bucket[i][1] = Math.max(bucket[i][1], x);
}
}
int gap = bucket[0][1] - bucket[0][0];
int prev = 0;
for( int i = 1; i < flag.length; i++) {
if (flag[i] == false) continue;
gap = Math.max(gap, bucket[i][0] - bucket[prev][1]);
prev = i;
}
return gap;
}
}