(self, inter: List[List[int]], new: List[int])
| 1 | class Solution: |
| 2 | def insert(self, inter: List[List[int]], new: List[int]) -> List[List[int]]: |
| 3 | # intervals.insert(1,new) |
| 4 | if len(inter)==0: |
| 5 | return [new] |
| 6 | for i in range(len(inter)): |
| 7 | if inter[i][0]<= new[0]: |
| 8 | inter.insert(i+1,new) |
| 9 | break |
| 10 | else: |
| 11 | inter.insert(i,new) |
| 12 | break |
| 13 | inter.sort() |
| 14 | # print(inter) |
| 15 | |
| 16 | ans=[] |
| 17 | temp = inter[0] |
| 18 | for i in inter: |
| 19 | if i[0]<=temp[1]: |
| 20 | temp[1] = max(temp[1],i[1]) |
| 21 | else: |
| 22 | ans.append(temp) |
| 23 | temp = i |
| 24 | ans.append(temp) |
| 25 | # print(temp) |
| 26 | return ans |
no outgoing calls
no test coverage detected