<p>Given an array&nbsp;of <code>intervals</code>&nbsp;where <code>intervals[i] = [start<sub>i</sub>, end<sub>i</sub>]</code>, merge all overlapping intervals, and return <em>an array of the non-overlapping intervals that cover all the intervals in the input</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> intervals = [[1,3],[2,6],[8,10],[15,18]]
<strong>Output:</strong> [[1,6],[8,10],[15,18]]
<strong>Explanation:</strong> Since intervals [1,3] and [2,6] overlap, merge them into [1,6].
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> intervals = [[1,4],[4,5]]
<strong>Output:</strong> [[1,5]]
<strong>Explanation:</strong> Intervals [1,4] and [4,5] are considered overlapping.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= intervals.length &lt;= 10<sup>4</sup></code></li>
	<li><code>intervals[i].length == 2</code></li>
	<li><code>0 &lt;= start<sub>i</sub> &lt;= end<sub>i</sub> &lt;= 10<sup>4</sup></code></li>
</ul>

class Solution {
public:

    static bool cmp(vector<int>& a, vector<int>& b)
    {
        return a[0] < b[0];
    }

    vector<vector<int>> merge(vector<vector<int>>& intervals) {
        sort(intervals.begin(), intervals.end(), cmp);
        if(intervals.size() == 1) return intervals;
        int mini = intervals[0][0] , maxi = intervals[0][1];
        vector<vector<int>> ans;
        bool flag = true;
        for(int i = 1 ; i < intervals.size(); i++){
           if(intervals[i][0] <= maxi && intervals[i][0] >= mini){
            flag = true;
            if(intervals[i][1] > maxi){
                maxi = intervals[i][1];
            }
           }else{
            flag = false;
            vector<int> temp(2);
            temp[0] = mini;
            temp[1] = maxi;
            ans.push_back(temp);
            mini = intervals[i][0];
            maxi = intervals[i][1];
           }
           if(i == intervals.size()-1){
            vector<int> temp(2);
            temp[0] = mini;
            temp[1] = maxi;
            ans.push_back(temp);
           }
        }

        return ans;
    }
};
23600