-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmerge_interval.cpp
More file actions
69 lines (58 loc) · 1.82 KB
/
merge_interval.cpp
File metadata and controls
69 lines (58 loc) · 1.82 KB
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include "merge_interval.h"
#include <algorithm>
auto MergeInterval::MergeIntervals(std::vector<std::vector<int>>& intervals)
-> std::vector<std::vector<int>>
{
// if array is empty
if (intervals.empty())
{
return {};
}
// sort intervals by start time
std::ranges::sort(intervals, [](const auto& a, const auto& b) {
return a[0] < b[0];
});
std::vector<std::vector<int>> result;
result.emplace_back(intervals[0]);
intervals.erase(intervals.begin());
for (const auto& interval : intervals)
{
// if current interval does not overlap with previous
if (result.back()[1] < interval[0])
{
result.emplace_back(interval);
}
else
{
result.back()[1] = std::max(result.back()[1], interval[1]);
}
}
return result;
}
auto MergeInterval::MergeIntervals(std::vector<std::vector<int>>& intervals, std::vector<int> new_interval)
-> std::vector<std::vector<int>>
{
std::vector<std::vector<int>> result;
int idx = 0;
// add all intervals starting before new_interval
while (idx < static_cast<int>(intervals.size()) && intervals[idx][1] < new_interval[0])
{
result.emplace_back(intervals[idx]);
++idx;
}
// merge all overlapping intervals to one considering new_interval
while (idx < static_cast<int>(intervals.size()) && intervals[idx][0] <= new_interval[1])
{
new_interval[0] = std::min(intervals[idx][0], new_interval[0]);
new_interval[1] = std::max(intervals[idx][1], new_interval[1]);
++idx;
}
result.emplace_back(new_interval);
// add all intervals starting after new_interval
while (idx < static_cast<int>(intervals.size()))
{
result.emplace_back(intervals[idx]);
++idx;
}
return result;
}