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.
C++实现代码：
#include<iostream> #include<vector> #include<algorithm> using namespace std; class Solution { public: int maximumGap(vector<int> &num) { if(num.size()<2) return 0; sort(num.begin(),num.end()); int i; int maximum=0; for(i=0;i<num.size()-1;i++) { if(num[i+1]-num[i]>maximum) maximum=num[i+1]-num[i]; } return maximum; } }; int main() { vector<int> vec={23,4,33,5,34,36,97,68,88,90}; Solution s; cout<<s.maximumGap(vec)<<endl; }
原文：http://www.cnblogs.com/wuchanming/p/4170655.html