首页 > 代码库 > Maximum Gap
Maximum Gap
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;}
Maximum Gap
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。