[LeetCode] Merge Intervals, Solution
来源:互联网 发布:mac虚拟机五国语言重启 编辑:程序博客网 时间:2024/05/16 01:03
Given a collection of intervals, merge all overlapping intervals.
For example,
Given
return
Given
[1,3],[2,6],[8,10],[15,18]
,return
[1,6],[8,10],[15,18]
.» Solve this problem
[Thoughts]
复用一下Insert Intervals的解法即可,http://codingtmd.azurewebsites.net/leetcode-insert-interval-%e8%a7%a3%e9%a2%98%e6%8a%a5%e5%91%8a/
创建一个新的interval集合,然后每次从旧的里面取一个interval出来,然后插入到新的集合中。
[Code]
黄色高亮部分是复用的Code.
1: vector<Interval> merge(vector<Interval> &intervals) {
2: vector<Interval> result;
3: for(int i =0; i< intervals.size(); i++)
4: {
5: insert(result, intervals[i]);
6: }
7: return result;
8: }
9: void insert(vector<Interval> &intervals, Interval newInterval) {
10: vector<Interval>::iterator it = intervals.begin();
11: while(it!= intervals.end())
12: {
13: if(newInterval.end<it->start)
14: {
15: intervals.insert(it, newInterval);
16: return;
17: }
18: else if(newInterval.start > it->end)
19: {
20: it++;
21: continue;
22: }
23: else
24: {
25: newInterval.start = min(newInterval.start, it->start);
26: newInterval.end = max(newInterval.end, it->end);
27: it =intervals.erase(it);
28: }
29: }
30: intervals.insert(intervals.end(), newInterval);
31: }
0 0
- [LeetCode] Merge Intervals, Solution
- Lintcode156 Merge Intervals solution 题解
- LeetCode: Merge Intervals
- LeetCode Merge Intervals
- LeetCode: Merge Intervals
- [Leetcode] Merge Intervals
- leetcode 28: Merge Intervals
- Leetcode: Merge Intervals
- [LeetCode] Merge Intervals
- [LeetCode]Merge Intervals
- leetcode merge intervals
- [leetcode]Merge Intervals
- LeetCode-Merge Intervals
- [leetcode] Merge Intervals
- LeetCode - Merge Intervals
- 【leetcode】Merge Intervals
- leetcode Merge Intervals
- LeetCode Merge Intervals
- [Interview] Serialize and De-serialize a tree
- [LeetCode] Path Sum, Solution
- [LeetCode] Regular Expression Matching, Solution
- 程序员生活八卦
- Mysql几种索引类型的区别及适用情况
- [LeetCode] Merge Intervals, Solution
- [LeetCode] Spiral Matrix II, Solution
- Media foundation——Media source:Media Source Events
- [LeetCode] Permutation Sequence, Solution
- Algorithm and Data Structure Review
- [TopCoder] SRM 578 DIV 2, Goose In Zoo, Solution
- 非UI线程中Toast
- [TopCoder] SRM 579 DIV 2, Marble Positioning, Solution
- nodeJS