56. Merge Intervals
Given a collection of intervals, merge all overlapping intervals.
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] overlaps, 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.
Solution
C++
class Solution {
public:
vector<vector<int>> merge(vector<vector<int>>& intervals) {
sort(intervals.begin(),intervals.end());
vector<vector<int> > res;
for(auto& i: intervals) {
if(res.size() && res[res.size()-1][1] >= i[0]) {
res[res.size()-1][1] = max(res[res.size()-1][1],i[1]);
}
else {
res.push_back(i);
}
}
return res;
}
};
Python
class Solution(object):
def merge(self, intervals):
out = []
for i in sorted(intervals):
if out and i[0] <= out[-1][1]:
out[-1][1] = max(out[-1][1], i[1])
else:
out.append(i),
return out
Explanation