-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q56.cpp
42 lines (35 loc) · 1001 Bytes
/
Q56.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#include<vector>
#include<algorithm>
using namespace std;
// Definition for an interval.
struct Interval {
int start;
int end;
Interval() : start(0), end(0) {}
Interval(int s, int e) : start(s), end(e) {}
};
class Solution {
public:
static bool cmp(Interval a, Interval b){
return a.start < b.start;
}
vector<Interval> merge(vector<Interval>& intervals) {
sort(intervals.begin(), intervals.end(), cmp);
int i = 0;
while (i < intervals.size() - 1){
if (intervals[i].end >= intervals[i+1].start){
intervals[i].end = max(intervals[i + 1].end, intervals[i].end);
intervals.erase(intervals.begin() + i + 1);
}
else i++;
}
return intervals;
}
};
int main(void){
vector<Interval> intervals = { Interval(2, 6), Interval(1, 3), Interval(8, 10), Interval(15, 18) };
vector<Interval> intervals2 = { Interval(1, 4), Interval(2, 3)};
Solution model;
vector<Interval> result = model.merge(intervals2);
return 0;
}