leetcode 2549. Count Distinct Numbers on Board

https://leetcode.com/problems/count-distinct-numbers-on-board/description/

Count Distinct Numbers on Board - LeetCode

 

class Solution:
    def distinctIntegers(self, n: int) -> int:
        answer = [n]
        for first_num in range(1, n+1):
            for second_num in range(1, first_num):
                if first_num % second_num ==1:
                    answer.append(first_num)
        answer = list(set(answer))
        if n == 1 or n == 2:
            return 1
        else:
            return len(answer)+1
 

거의 O(N^2)에 가까운 풀이라 더 좋은 풀이 아시는 분 있으면 공유 부탁드려요!