知识框架
No.0 筑基
请先学习下知识点,道友!
题目知识点大部分来源于此:题目例题大部分来源于此:
Y总的模板来自Acwing如下:
// 将所有存在交集的区间合并
void merge(vector<PII> &segs)
{
vector<PII> res;
sort(segs.begin(), segs.end());
int st = -2e9, ed = -2e9;
for (auto seg : segs)
if (ed < seg.first)
{
if (st != -2e9) res.push_back({st, ed});
st = seg.first, ed = seg.second;
}
else ed = max(ed, seg.second);
if (st != -2e9) res.push_back({st, ed});
segs = res;
}
No.1 字符矩阵
题目来源:Acwing-803. 区间合并
题目描述:
题目思路:
题目代码:
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef pair<int, int> PII;
int n, l, r;
vector<PII> segs;
void merge(vector<PII> &segs)
{
vector<PII> res;
sort(segs.begin(), segs.end());//按区间左端点排序,sort默认排序segs的第一项
int st = -2e9, ed = -2e9;//此时st和ed只要比-1e9小就可以
for (auto seg : segs)
{
if (ed < seg.first)
{
if (st != -2e9) res.push_back({st, ed});
st = seg.first;
ed = seg.second;
}
else ed = max(ed, seg.second);
}
if (st != -2e9) res.push_back({st, ed});
segs = res;//不能忘
}
int main()
{
cin >> n;
for (int i = 0; i < n; i ++ )
{
cin >> l >> r;
segs.push_back({l, r});
}
merge(segs);
cout << segs.size() << endl;
return 0;
}//该代码引用AcWing网站的代码