_56. Merge Intervals.md

56. Merge Intervals

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : June 19, 2024

Last updated : June 19, 2024

---

Related Topics : Array, Sorting

Acceptance Rate : 48.85 %

---

Solutions

• m56.py

Python

m56.py

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
        stk = []

        intervals.sort(key=lambda x: x[0], reverse=True)
        
        while intervals :
            start, stop = intervals.pop()

            if not stk :
                stk.append([start, stop])
                continue

            if stk[-1][1] < start :
                stk.append([start, stop])
            elif stk[-1][1] < stop :
                stk[-1][1] = stop
            

        return stk