Class Solution

LeetCode_problems/Insert Interval/solution.cpp:31–64

AUTHOR: github.com/Sanjay235 LOGIC: ========================================================================================== 1. As the set of intervals provided are non-overlapping and sorted, we don't need to do additional sorting for ease of merge. 2. First traverse all intervals in the set for which end point is less than start point of new interval and reach an overlapping interval with

==========================================================================================
*/
class Solution {
public:
    vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
        vector<vector<int>> res;
        
        int index = 0;
        
	// Step - 2
        while(index < intervals.size() && intervals[index][1] < newInterval[0]){
            res.push_back(intervals[index++]);
        }
        
	// Step - 3
        while(index < intervals.size() && intervals[index][0] <= newInterval[1]){
            // Step - 3 (a)
	    newInterval[0] = min(newInterval[0], intervals[index][0]);
            
	    // Step - 3 (b)
	    newInterval[1] = max(newInterval[1], intervals[index][1]);
            
	    index++;
        }
        
	// Step - 4
        res.push_back(newInterval);
        
	// Step - 5
        while(index < intervals.size()){
            res.push_back(intervals[index++]);
        }
        
        return res;
    }
};