08-Merge_Intervals

#include <bits/stdc++.h> 
/*

    intervals[i][0] = start point of i'th interval
    intervals[i][1] = finish point of i'th interval

*/

vector<vector<int>> mergeIntervals(vector<vector<int>> &intervals)
{
    // Write your code here.
    vector<vector<int>> ans;
    if(intervals.size()==0){
        return ans;
    }

    sort(intervals.begin(),intervals.end());

    vector<int> temp=intervals[0];

    for(auto i:intervals){
        if(temp[1] >= i[0]){
            temp[1]=max(temp[1],i[1]);
        }
        else{
            ans.push_back(temp);
            temp=i;
        }
    }

    ans.push_back(temp);
    return ans;

}