소프트웨어에 대한 모든 것

LeetCode 풀기 - 1288. Remove Covered Intervals 본문

알고리즘/LeetCode

LeetCode 풀기 - 1288. Remove Covered Intervals

앤테바 2022. 2. 20. 21:14
반응형

1288. Remove Covered Intervals

https://leetcode.com/problems/remove-covered-intervals/

 

Remove Covered Intervals - LeetCode

Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

leetcode.com

문제)

 

솔루션1)

class Solution:
    def removeCoveredIntervals(self, nums: List[List[int]]) -> int:
        count = len(nums)
        
        # 오름차순 정렬
        nums = sorted(nums, key=lambda x: x[0])
        
        target_num = nums[0]
        target_idx = 0
        
        for i, num in enumerate(nums[1:]):        
            if num[1] <= target_num[1]:
                count -= 1
            else:
                if num[0] == target_num[0]:
                    count -= 1
                target_idx = i
                target_num = num

        return count

 

반응형
Comments