Merge interval--merge intervals

https://leetcode.com/problems/merge-intervals/

Merge intervals

Given a collection of intervals, merge all overlapping intervals.

For example,
Given [1,3],[2,6],[8,10],[15,18] ,
Return [1,6],[8,10],[15,18] .

Test instructions: Merging simplified interval columns

1 #Definition for an interval.2 #class Interval:3 #def __init__ (self, s=0, e=0):4 #Self.start = s5 #self.end = e6 7 classSolution:8     #@param {interval[]} intervals9     #@return {interval[]}Ten     defmerge (self, intervals): OneIntervals.sort (key=LambdaX:x.start)#Note the form, sorted by the number of intervals left ALength=len (intervals)#total number of intervals -res=[] -          forIinchRange (length):#use I to iterate through each interval sequentially, to process the             ifRes==[]:#The first zone joins directly - res.append (intervals[i]) -             Else: -Size=len (RES)#find the last interval of an existing interval column res res[size-1] +                 ifRes[size-1].start<=intervals[i].start<=res[size-1].end:#don't forget the equals sign on both sides . -Res[size-1].end=max (Intervals[i].end,res[size-1].end)#only update right interval, left still with Res[size-1].start +                 Else: ARes.append (Intervals[i])#If the left interval is not included in the previous interval, join directly at          returnRes

Merge interval--merge intervals