452. Minimum Number of Arrows to Burst Balloons

LeetCode - The World's Leading Online Programming Learning Platform

class Solution:
    def findMinArrowShots(self, points: List[List[int]]) -> int:
        rets=[]
        intervals=sorted(points)
        prev=intervals[0]
        # print(intervals)
        for i in range(1,len(intervals)):
            curr=intervals[i]
            if prev[1]>=curr[0]:
                prev[1]=min(prev[1],curr[1])
            else:
                rets.append(prev)
                prev=curr
        rets.append(prev)
        return len(rets)