Merge Intervals (Leetcode 56)

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

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
        intervals.sort(key=lambda x:x[0])
        s=[]
        s.append(intervals[0])
        for i in range(1,len(intervals)):
            t=s[len(s)-1]
            if(t[1]<intervals[i][0]):
                s.append(intervals[i])
            elif(t[1]>=intervals[i][0] and t[1]<intervals[i][1]):
                t[1]=intervals[i][1]
            elif(t[1]>intervals[i][0] and t[1]>=intervals[i][1]):
                continue
        return s