leetcode(164):Maximum Gap

题目 Maximum Gap Hard Given an unsorted array, find the maximum difference between the successive elements in its sorted form. Return 0 if the array contains less than 2 elements. Example 1: Input: [3,6
相关文章
相关标签/搜索