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.
桶排序/基数排序都可以,这里说一下官方给出的桶排序,对于长度为n,最小值为min,最大值为max的整数数组来说,max gap不小于ceiling((max-min)/(n-1)),我们根据这个gap可以将这个数组划分为n-1个范围,即n-1个桶,第k个桶所表示的范围为min+(k-1)gap~min+kgap,我们将除了max和min的最多n-2个数装入桶中,比较后一个桶的最小值减去前一个桶的最大值(还要比较min和max和第一个桶和最后一个桶),求出max gap,代码:
public int maximumGap(int[] nums) { if(nums.length<2) return 0; int min=Integer.MAX_VALUE; int max=Integer.MIN_VALUE; for(int i:nums){ min=Math.min(i,min); max=Math.max(i,max); } int gap=(int)Math.ceil((double)(max-min)/(nums.length-1)); int[] arrmin=new int[nums.length-1]; int[] arrmax=new int[nums.length-1]; Arrays.fill(arrmin,Integer.MAX_VALUE); Arrays.fill(arrmax,Integer.MIN_VALUE); for(int i:nums){ if(i==min||i==max) continue; int k=(i-min)/gap; arrmax[k]=Math.max(arrmax[k],i); arrmin[k]=Math.min(arrmin[k],i); } int maxgap=0; int temp=min; for(int i=0;i<arrmin.length;i++){ if(arrmin[i]==Integer.MAX_VALUE&&arrmax[i]==Integer.MIN_VALUE) continue; maxgap=Math.max(arrmin[i]-temp,maxgap); temp=arrmax[i]; } maxgap=Math.max(max-temp,maxgap); return maxgap; }