[99클럽] 6일차 TIL

오늘은 리트코드 사이트의 문제를 풀어보았습니다.

 

https://leetcode.com/problems/smallest-number-in-infinite-set/description/

 

 

 

class SmallestInfiniteSet:

    def __init__(self):
        self.present = [True for _ in range(1002)]

    def popSmallest(self) -> int:
        for x in range(1, 1001):
            if self.present[x]:
                self.present[x] = False
                return x

    def addBack(self, num: int) -> None:
        self.present[num] = True
        


# Your SmallestInfiniteSet object will be instantiated and called as such:
# obj = SmallestInfiniteSet()
# param_1 = obj.popSmallest()
# obj.addBack(num)