Merge Intervals

代码：

 1 #include<iostream>
 2 #include<vector>
 3 #include<algorithm>
 4
 5 using namespace std;
 6
 7 struct Interval {
 8     int start;
 9     int end;
10     Interval() : start(0), end(0) {}
11     Interval(int s, int e) : start(s), end(e) {}
12 };
13
14 bool compare(Interval &a, Interval &b)
15 {
16     return a.start < b.start;
17 }
18
19 vector<Interval> merge(vector<Interval>& intervals)
20 {
21     vector<Interval> result;
22     sort(intervals.begin(), intervals.end(), compare);
23     for (int i = 0; i < intervals.size()-1; i++)
24     {
25         if ((i+1!=intervals.size()-1)&&intervals[i].end >= intervals[i + 1].start)
26         {
27             intervals[i].end = intervals[i + 1].end;
28         }
29         else
30         {
31             result.push_back(intervals[i]);
32         }
33     }
34     return result;
35 }
36
37
38 int main()
39 {
40     Interval I1(1,3);
41     Interval I2(2,6);
42     Interval I3(8, 10);
43     Interval I4(15,18);
44     vector<Interval> itervals;
45     itervals.push_back(I1);
46     itervals.push_back(I2);
47     itervals.push_back(I3);
48     itervals.push_back(I4);
49
50     vector<Interval> result = merge(itervals);
51     for (int i = 0; i < result.size(); i++)
52     {
53         cout << result[i].start << "    " << result[i].end << endl;
54     }
55 }

转载于:https://www.cnblogs.com/chaiwentao/p/4646651.html

Merge Intervals相关推荐

[LeetCode]Merge Intervals
题目:Merge Intervals 给定n个区间合并重合区间思路: 先按照区间起点排序,然后合并下面情况: 1.起点相同,以最大的终点为新的终点: 2.前一个终点大于后一个的起点. /****** ...
【leetcode】56. Merge Intervals 相邻线段归并
1. 题目 Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2, ...
C#LeetCode刷题之#56-合并区间（Merge Intervals）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3676 访问. 给出一个区间的集合,请合并所有重叠的区间. 输入: ...
【细节实现题】LeetCode 56. Merge Intervals
LeetCode 56. Merge Intervals Solution1:我的答案这道题思路不难,有个坑爹的地方在于输入的区间向量未必是有序的,所以利用优先队列priority_queue来排序 ...
56. Merge Intervals（合并区间）解法（C++ 注释）
56. Merge Intervals(合并区间) 1. 题目描述 2. 排序(Sorting) 2.1 解题思路 2.2 实例代码 1. 题目描述给出一个区间的集合,请合并所有重叠的区间. 示例 ...
LeetCode 56. Merge Intervals
原题链接在这里:https://leetcode.com/problems/merge-intervals/ 题目: Given a collection of intervals, merge al ...
LeetCode Merge Intervals
Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8, ...
LeetCode:Merge Intervals
题目链接 Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6 ...
merge intervals(合并间隔)
Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8, ...

Merge Intervals

Merge Intervals相关推荐

最新文章

热门文章