[LeetCode] Insert Interval

最新推荐文章于 2020-11-04 20:53:35 发布

HQBUPT

最新推荐文章于 2020-11-04 20:53:35 发布

阅读量516

点赞数

分类专栏： LeetCode 文章标签： LeetCode 刷题

本文链接：https://blog.csdn.net/HQBUPT/article/details/37883629

版权

LeetCode 专栏收录该内容

84 篇文章 0 订阅

订阅专栏

vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
	int beg = intervals.size(), end = intervals.size()-1;
	bool getBeg = false;
	for (int i = 0; i < intervals.size(); i++)
	{
		if (newInterval.start <= intervals[i].start)
		{
			if (!getBeg)
			{
				beg = i;
				getBeg = true;
			}
		}
		else if (intervals[i].start < newInterval.start && newInterval.start <= intervals[i].end)
		{
			newInterval.start = intervals[i].start;
			if (!getBeg)
			{
				beg = i;
				getBeg = true;
			}
		}
		if (newInterval.end < intervals[i].start)
		{
			end = i - 1;
			break;
		}
		if (newInterval.end >= intervals[i].start && newInterval.end <= intervals[i].end)
		{
			newInterval.end = intervals[i].end;
			end = i;
			break;
		}
	}
	if (end == -1)
	{
		intervals.insert(intervals.begin(), newInterval);
		return intervals;
	}
	if (beg == intervals.size())
	{
		intervals.push_back(newInterval);
		return intervals;
	}
	intervals.erase(intervals.begin()+beg, intervals.begin()+end+1);
	intervals.insert(intervals.begin()+beg, newInterval);
	return intervals;

}