LeetCode Algorithm 0056 - Merge Intervals (Medium)

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

返回上级：LeetCode 算法目录

Problem Link: https://leetcode.com/problems/merge-intervals/

Related Topics: Array Sort

Description

Given a collection of intervals, merge all overlapping intervals.

Example 1:

Input: [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].

Example 2:

Input: [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] are considered overlapping.

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/merge-intervals/
// Difficulty: Medium
// Related Topics: `Array` `Sort`
// time: O(nlogn)

#pragma once

#include "pch.h"

namespace P56MergeIntervals
{
    class Solution
    {
        public:
        vector<vector<int>> merge(vector<vector<int>>& intervals)
        {
            vector<vector<int>> results;

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

            return results;
        }

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