[LeetCode] 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.

Credits:
Special thanks to @porker2008 for adding this problem and creating all test cases.

参考：

http://blog.csdn.net/u011345136/article/details/41963051

 http://blog.csdn.net/u012162613/article/details/41936569

[LeetCode] Maximum Gap 求最大间距

原文：http://www.cnblogs.com/grandyang/p/4234970.html