Leet Code OJ 57. Insert Interval [Difficulty: Hard]

最新推荐文章于 2020-10-09 13:08:01 发布

循环是人递归是神

最新推荐文章于 2020-10-09 13:08:01 发布

阅读量86

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/qq_35752161/article/details/102700109

版权

Leetcode 专栏收录该内容

67 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<vector>
#include<iomanip>

using namespace std;

vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval)
{
	vector<vector<int>> reslt;
	for (int i = 0; i < intervals.size(); i++)
	{
		if ((newInterval[1] >= intervals[i][0] && newInterval[0] <= intervals[i][0])
			|| (newInterval[1] >= intervals[i][1] && newInterval[0] <= intervals[i][1])
			|| (newInterval[1] <= intervals[i][1] && newInterval[0] >= intervals[i][0]))
		{
			newInterval[0] = min(intervals[i][0], newInterval[0]);
			newInterval[1] = max(intervals[i][1], newInterval[1]);
		}
		else
		{
			reslt.push_back(intervals[i]);
		}
	}
	reslt.push_back(newInterval);
	sort(reslt.begin(), reslt.end());
	return reslt;
}

int main()
{

	vector<vector<int>> intervals, t;
	vector<int> newintervals;
	intervals.push_back({ 1,2 });
	intervals.push_back({ 3,5 });
	intervals.push_back({6,7 });
	intervals.push_back({ 8,10 });
	intervals.push_back({ 12,16 });
	newintervals.push_back(4);
	newintervals.push_back(8);
	t = insert(intervals, newintervals);
	return 0;
}