DSA-Practice/DAY0012.cpp at main · Krrish-29/DSA-Practice · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
// 56. Merge Intervals
class Solution {
    public:
        vector<vector<int>> merge(vector<vector<int>>& intervals) {
            sort(intervals.begin(), intervals.end());
            for(int i=1;i<intervals.size();i++){
                int upper=intervals[i-1][1],lower=intervals[i-1][0];
                if(lower<=intervals[i][0]&&upper>=intervals[i][1]){
                    intervals[i][0]=intervals[i-1][0];
                    intervals[i][1]=intervals[i-1][1];
                    intervals.erase(intervals.begin()+i-1);
                    i--;
                }
                else if(lower>=intervals[i][0]&&upper<=intervals[i][1]){
                    intervals.erase(intervals.begin()+i-1);
                    i--;
                }
                else if(lower>=intervals[i][0]){
                    intervals[i][1]=intervals[i-1][1];
                    intervals.erase(intervals.begin()+i-1);
                    i--;
                }
                else if(upper>=intervals[i][0]){
                    intervals[i][0]=intervals[i-1][0];
                    intervals.erase(intervals.begin()+i-1);
                    i--;
                }
            }
            return intervals;
        }
    };