-
Notifications
You must be signed in to change notification settings - Fork 0
/
56.合并区间.cpp
91 lines (83 loc) · 2.39 KB
/
56.合并区间.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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
/*
* @lc app=leetcode.cn id=56 lang=cpp
*
* [56] 合并区间
*/
#include <vector>
#include <cstdlib>
#include <iostream>
using namespace std;
// @lc code=start
class Solution
{
public:
vector<vector<int>> merge(vector<vector<int>> &intervals)
{
if (intervals.size() == 1)
return intervals;
quickSort(intervals);
vector<vector<int>> res;
for (int i = 0; i < intervals.size() - 1; i++)
{
vector<int> newIntv;
int j = i;
int cursor = intervals[j][1];
for (; j < intervals.size() - 1; j++)
{
if (cursor >= intervals[j + 1][0])
{
if (cursor <= intervals[j + 1][1])
{
cursor = intervals[j + 1][1];
continue;
}
else
{
continue;
}
}
else
{
break;
}
}
newIntv = vector<int>{intervals[i][0], cursor};
res.push_back(newIntv);
i = j;
}
if (res.back()[1] < intervals.back()[0])
res.push_back(intervals.back());
return res;
}
int partition(vector<vector<int>> &arr, int low, int high)
{
int pivot = arr[low][0]; //基准
int subpivot = arr[low][1];
while (low < high)
{
while (low < high && arr[high][0] >= pivot)
--high;
arr[low] = arr[high]; //交换比基准大的记录到左端
while (low < high && arr[low][0] <= pivot)
++low;
arr[high] = arr[low]; //交换比基准小的记录到右端
}
//扫描完成,基准到位
arr[low] = vector<int>{pivot, subpivot};
//返回的是基准的位置
return low;
}
void qsort(vector<vector<int>> &arr, int low, int high)
{
if (low >= high)
return;
int pivot = partition(arr, low, high); //将数组分为两部分
qsort(arr, low, pivot - 1); //递归排序左子数组
qsort(arr, pivot + 1, high); //递归排序右子数组
}
void quickSort(vector<vector<int>> &arr)
{
qsort(arr, 0, arr.size() - 1);
}
};
// @lc code=end