Merge Intervals | Leetcode 56 solution

 56. Merge Intervals | Leetcode solution 56

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

 

Example 1:

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

Example 2:

Input: intervals = [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] are considered overlapping.

 

Constraints:

• 1 <= intervals.length <= 104
• intervals[i].length == 2
• 0 <= starti <= endi <= 104

Solution :

class Solution { public:     vector<vector<int>> merge(vector<vector<int>>& intervals) {         int size = intervals.size();         sort(intervals.begin(), intervals.end());         vector<vector<int>>result;         for(int i =0 ; i  < size ; i++)         {             if(i ==0)             {                 result.push_back(intervals[i]);             }             else             {                 if(intervals[i][0] <= result.back()[1])                 {                     result.back()[1] = max(intervals[i][1] , result.back()[1] );                 }                 else                 {                     result.push_back(intervals[i]);                 }             }         }         return result;           } };