给定一个数组,求如果排序之后,相邻两数的最大差值,要求时 间复杂度O(N),且要求不能用非基于比较的排序
public class MaxGap {
public static int maxGap(int[] nums) {
if (nums == null || nums.length < 2) {
return 0;
}
int len = nums.length;
//将最小值设为系统最大值
int min = Integer.MAX_VALUE;
//将最大值设为系统最小值
int max = Integer.MIN_VALUE;
//遍历整个数组,找出最小值最大值
for (int i = 0; i < len; i++) {
min = Math.min(min, nums[i]);
max = Math.max(max, nums[i]);
}
if (min == max) {
return 0;
}
//这三个数组为桶,分别记录最大值和最小值
boolean[] hasNum = new boolean[len + 1];//记录是否有元素进入
int[] maxs = new int[len + 1];//记录最大值
int[] mins = new int[len + 1];//记录最小值
//在每个桶中记录最大值和最小值,以及是否有元素进入
int bid = 0;
for (int i = 0; i < len; i++) {
bid = bucket(nums[i], len, min, max);
mins[bid] = hasNum[bid] ? Math.min(mins[bid], nums[i]) : nums[i];
maxs[bid] = hasNum[bid] ? Math.max(maxs[bid], nums[i]) : nums[i];
hasNum[bid] = true;//有元素进入置为true
}
int res = 0;
int lastMax = maxs[0];
int i = 1;
//找出最大值
for (; i <= len; i++) {
if (hasNum[i]) {
res = Math.max(res, mins[i] - lastMax);
lastMax = maxs[i];
}
}
return res;
}
//找到进入哪个桶
public static int bucket(long num, long len, long min, long max) {
return (int) ((num - min) * len / (max - min));
}
}