2016年9月3日
[LintCode] Maximum Gap 求最大间距
摘要： 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 el 阅读全文
posted @ 2016-09-03 23:58 Grandyang 阅读(1136) 评论(0) 推荐(0) 编辑
Fork me on GitHub