(1)排序
class Solution {
public:
int maximumGap(vector<int>& nums) {
if(nums.size()<2) return 0;
sort(nums.begin(),nums.end());
int maxs=INT_MIN;
for(int i=0;i<nums.size();i++) {
if(i+1<nums.size()) {
maxs=max(maxs,nums[i+1]-nums[i]);
}
}
return maxs;
}
};