008_Merge Intervals.cpp

#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.

    int n = intervals.size();

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

    vector<vector<int>> ans;


    ans.push_back({intervals[0]});

    for(int i = 1; i < n; ++i){
        if(intervals[i][0] > ans.back()[1])
        {
            ans.push_back({intervals[i][0], intervals[i][1]});
        }
        else
        {
            ans.back()[1] = max(ans.back()[1], intervals[i][1]);
        }
    }
    return ans;

}