leetcode 1893

Posted 2021-08-26 东东就是我

class Solution:
    def isCovered(self, ranges, left, right):
        i=left
        while i <=right:
            find=False
            for range in ranges:
                if range[0]<=i and range[1]>=i:
                    i=range[1]+1
                    find=True
                    break
            if find is False:
                return False

        return True