ACM-排序
文章平均质量分 73
LarryNLPIR
专注NLP/IR/Machine Learning/Data Mining
展开
-
LeetCode Merge Intervals
题目:Given a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18].思路分析:这题关键要想到先对区间排序,然后从前向后扫描,如果下一个没法合并,就添加一个区间;如果可以,还要继续向后看,原创 2014-11-23 11:02:09 · 2094 阅读 · 0 评论 -
LeetCode Sort List
Sort a linked list in O(n log n) time using constant space complexity.思路分析:这题要求在O(n log n) 和常量空间对单链表排序,O(n log n) 的排序算法有快速排序,归并排序和堆排序,对于快速排序,其最坏情况下的时间复杂读是O(n),所以不符合要求。我们可以用归并排序解决这题。用归并排序的好处是平均时间和最坏时间都原创 2015-01-27 13:29:49 · 2142 阅读 · 1 评论 -
LeetCode Sort Colors (One Pass Solution)
LeetCode - Sort ColorsGiven an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will原创 2014-10-29 13:01:46 · 3233 阅读 · 0 评论 -
POJ 1828 选猴王 排序qsort应用
<br /> 今天总算上完一门课了,以后做OJ的时间可以渐渐多一些。好几天疲于奔命,OJ也没写几题,囧。今天补起来,补一篇处女博!<br /> 这题很简单,但是第一次做的时候没有排序采用暴力判断超时,后来想到先排序再判断更快。<br />#include <iostream>using namespace std;struct mon{ int x; int y;};//按照x y升序排列,如果不排序直接判断容易超时int cmp(const void *a,const原创 2010-12-04 21:40:00 · 1595 阅读 · 0 评论 -
LeetCode First Missing Positive
Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses constant space.思路分析:原创 2015-03-29 13:01:58 · 1704 阅读 · 0 评论 -
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原创 2015-03-18 08:40:39 · 2722 阅读 · 0 评论 -
LeetCode Insert Interval
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start times.Example 1原创 2015-03-18 12:50:48 · 1228 阅读 · 0 评论