![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
桶排序
sscssz
这个作者很懒,什么都没留下…
展开
-
【leetcode题解】【再看一遍】【86】【M】Contains Duplicate III
Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at most t and the difference between i and j原创 2015-12-17 23:08:52 · 428 阅读 · 0 评论 -
164. Maximum Gap【H】【80】【桶排序】【VIP】
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原创 2016-05-13 21:55:49 · 628 阅读 · 0 评论