LeetCode Algorithm 0057 - Insert Intervals (Hard)

最新推荐文章于 2021-02-28 23:32:43 发布

沙沙的兔子

最新推荐文章于 2021-02-28 23:32:43 发布

阅读量167

点赞数

分类专栏： LeetCode 文章标签： LeetCode sort array 算法基础

本文链接：https://blog.csdn.net/DarkRabbit/article/details/89606591

版权

LeetCode 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

LeetCode Algorithm 0057 - Insert Intervals (Hard)

返回分类：全部文章 >> 基础知识

返回上级：LeetCode 算法目录

Problem Link: https://leetcode.com/problems/insert-interval/

Description

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).

You may assume that the intervals were initially sorted according to their start times.

Example 1:

Input: intervals = [[1,3],[6,9]], newInterval = [2,5]
Output: [[1,5],[6,9]]

Example 2:

Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]
Output: [[1,2],[3,10],[12,16]]
Explanation: Because the new interval [4,8] overlaps with [3,5],[6,7],[8,10].

NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

Solution C++

// Author: https://blog.csdn.net/DarkRabbit
// Problem: https://leetcode.com/problems/insert-interval/
// Difficulty: Hard
// Related Topics: `Array` `Sort`
// time: O(nlogn)

#pragma once

#include "pch.h"

namespace P57InsertIntervals
{
    class Solution
    {
        public:
        vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval)
        {
            if (newInterval.empty())
            {
                return intervals;
            }

            if (intervals.empty())
            {
                return { newInterval };
            }

            vector<vector<int>> results;

            intervals.push_back(newInterval);
            sort(intervals.begin(), intervals.end(), Compare);

            for (int i = 0; i < intervals.size(); i++)
            {
                int last = results.size() - 1;
                if (results.empty() || results[last][1] < intervals[i][0])
                {
                    results.push_back(intervals[i]);
                }
                else if (results[last][1] < intervals[i][1])
                {
                    results[last][1] = intervals[i][1];
                }
            }

            return results;
        }

        static bool Compare(vector<int>& left, vector<int>& right)
        {
            return left[0] < right[0];
        }
    };
}