-
Notifications
You must be signed in to change notification settings - Fork 0
/
Merge Intervals using vectors.cpp
70 lines (60 loc) · 1.52 KB
/
Merge Intervals using vectors.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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <iostream>
#include <vector>
#include <chrono>
#include <algorithm>
using namespace std;
using namespace std::chrono;
vector<vector<int>> merge(vector<vector<int>> &interval)
{
int i = 0, j = 1, f = 0;
sort(interval.begin(), interval.end());
vector<vector<int>> intervalans;
while (j < interval.size())
{
if (interval[i][1] >= interval[j][0])
{
if (interval[i][1] < interval[j][1])
{
interval[i][1] = interval[j][1];
}
j++;
f = 0;
}
else
{
intervalans.push_back({interval[i][0], interval[i][1]});
i = j;
j++;
f = 1;
}
}
if (f == 0)
{
intervalans.push_back({interval[i][0], interval[i][1]});
}
else if (j == interval.size())
{
intervalans.push_back({interval[i][0], interval[i][1]});
}
return intervalans;
}
int main()
{
vector<vector<int>> interval = {{1, 4}, {2, 3}};
auto start = high_resolution_clock::now();
interval = merge(interval);
auto stop = high_resolution_clock::now();
auto duration = duration_cast<minutes>(stop - start);
cout << "Time taken by function: "
<< duration.count() << " ms" << endl;
for (int i = 0; i < interval.size(); i++)
{
for (int j = 0; j < 2; j++)
{
cout << interval[i][j] << " ";
}
cout << endl;
}
return 0;
}
//{1, 6}, {1, 5}, {2, 16}, {1, 10}, {18, 20}, {16, 18}, {21, 23}