-
Notifications
You must be signed in to change notification settings - Fork 46
/
merge_interval.cpp
53 lines (40 loc) · 1.02 KB
/
merge_interval.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
43
44
45
46
47
48
49
50
51
52
53
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> merge (vector<vector<int>> &intervals) {
int n = intervals.size();
vector<vector<int>> mergedIntervals;
if (n == 0) {
return mergedIntervals;
}
sort(intervals.begin(), intervals.end());
vector<int> newInterval = intervals[0];
for (int i = 1; i < n; i++) {
if (intervals[i][0] <= newInterval[1]) {
newInterval[1] = max (intervals[i][1], newInterval[1]);
}
else {
mergedIntervals.push_back (newInterval);
newInterval = intervals[i];
}
}
mergedIntervals.push_back (newInterval);
return mergedIntervals;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<vector<int>> intervals(n);
for (int i = 0; i < n; i++) {
int a, b; cin >> a >> b;
intervals[i].push_back (a);
intervals[i].push_back (b);
}
vector<vector<int>> mergedIntervals = merge (intervals);
for (auto it : mergedIntervals) {
cout << "["<< it[0] << ", " << it[1] << "]\n";
}
return 0;
}