-
Notifications
You must be signed in to change notification settings - Fork 0
/
LeetCode_MergeIntervals.cpp
42 lines (41 loc) · 1.11 KB
/
LeetCode_MergeIntervals.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
class Solution {
public:
static bool compare (vector<int>& a, vector<int>& b)
{
return a[0] < b[0];
}
vector<vector<int>> merge(vector<vector<int>>& intervals) {
vector<vector<int>> answer;
if(intervals.empty())
{
return answer;
}
sort(intervals.begin(), intervals.end(), compare);
int start = intervals[0][0];
int end = intervals[0][1];
for(int i = 1; i < intervals.size(); i++)
{
if(intervals[i][0] > end)
{
vector<int> merged;
merged.push_back(start);
merged.push_back(end);
answer.push_back(merged);
start = intervals[i][0];
end = intervals[i][1];
}
else
{
if(end < intervals[i][1])
{
end = intervals[i][1];
}
}
}
vector<int> merged;
merged.push_back(start);
merged.push_back(end);
answer.push_back(merged);
return answer;
}
};