LeetCode 刷题记录 56. Merge Intervals

题目：
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.

排序法
首先这道题是没有排序的，首先我们要根据第一个元素进行排序
然后首先先加入第一个列表，然后再遍历剩下的列表
遍历的列表与结果集中的最后一个列表比较
两种情况：

1. 遍历的列表的最小值比结果集中的最后一个列表的最大值还大，不能合并，加入结果集即可
2. 否则，可以合并，此时只需更新合并列表的最大值即可
   
   图来自Approach 2: Sorting
   c++:

class Solution {
   
public:
    vector<vector<int>> merge(vector<vector<int>>& intervals) {
   
        if(intervals.empty()) return {
   };
        vector<vector<int>> res;
        sort(intervals.begin(),intervals.end());
        res.push_back(intervals[0]