排序57.插入区间

Leetcode57.插入区间

给出一个无重叠的 ，按照区间起始端点排序的区间列表。
在列表中插入一个新的区间，你需要确保列表中的区间仍然有序且不重叠（如果有必要的话，可以合并区间）。
示例：
输入：intervals = [[1,3],[6,9]], newInterval = [2,5]
输出：[[1,5],[6,9]]

顺序比较，插入

class Solution {
public:
    vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
        vector<vector<int>> res;
        int n = intervals.size();
        int i = 0;
        while(i < intervals.size() && intervals[i][1] <newInterval[0]){
            res.push_back(intervals[i]);
            i++;
        }
        while(i< intervals.size() && intervals[i][0] <= newInterval[1]){
            newInterval[0] = min(newInterval[0], intervals[i][0]);
            newInterval[1] = max(newInterval[1], intervals[i][1]);
            i++;
        }

        res.push_back(newInterval);
        while(i< intervals.size())
            res.push_back(intervals[i++]);
        return res;
    }
};

直接插入再比较

class Solution {
public:
     vector<vector<int>> merge(vector<vector<int>>& intervals) {
        vector<vector<int>> res;
        vector<int> starts,ends;
        for(int i=0;i<intervals.size();i++)
        {
            starts.push_back(intervals[i][0]);
            ends.push_back(intervals[i][1]);
        }
        sort(starts.begin(),starts.end());
        sort(ends.begin(),ends.end());
        for(int i=0,j=0;i<intervals.size();i++)
        {
            if(i==intervals.size()-1 || starts[i+1]>ends[i] )
            {
                res.push_back({starts[j],ends[i]});
                j = i+1;
            }
        }
        return res;
    }
    vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval)    {
        vector<vector<int>> res;
        intervals.push_back(newInterval);
        res = merge(intervals);
        return res;
    }


};