double check 400. Maximum Gap
class Solution { public : Given an unsorted array, find the maximum difference between the successive elements in its sorted form. 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. Have you met this question in a real interview? Yes Problem Correction Example Given [1, 9, 2, 5] , the sorted form of it is [1, 2, 5, 9] , the maximum gap is between 5 and 9 = 4 . Challenge Sort is easy but will cost O(nlogn) time. Try to solve it in linear time and space. /** * @param nums: an array of integers * @return: the maximun difference */ int maximumGap ( vector < int > &nums) { // write your code here // O(n) bucket sort // 思想就是分组，然后不是各元素比较，二是组比较 // 1，找到最大值，最小值 // 2, 所要找的GAP >= (max - min) / size...