lc57.hard 插入区间（区间重叠的判断，扩大待插入区间的范围，***找到插入位置）

class Solution {
public:
    vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
        int len=intervals.size();
        int start=newInterval[0], end=newInterval[1];
        vector<vector<int>> ans;
        int placed=0;
        for(vector<int>& interval:intervals){
            if(end<interval[0]){
                if(!placed){
                    ans.push_back( {start, end} );  //找到start~end的插入位置
                    placed=1;
                }
                ans.push_back(interval);
            }
            else if(start>interval[1])
                ans.push_back(interval);
            else{
                start=min(start, interval[0]);
                end=max(end, interval[1]);  //扩大start~end
            }
        }
        if(!placed) ans.push_back({start, end});  //start~end的位置应在最后一个
        return ans;
    }
};