leetcode-Maximum Gap

标签：leetcode

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.

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

leetcode-Maximum Gap

标签：leetcode

原文地址：http://blog.csdn.net/lp2hsf/article/details/41923253