[leetCode] 1291. Sequential Digits (Python)

코딩 1일 1문제! 오늘의 문제는 leetCode의 Sequential Digits 입니다.

Sequential Digits - LeetCode

👨🏻‍💻 코드 ( Solution )

class Solution:
    def sequentialDigits(self, low: int, high: int) -> List[int]:
        answer = []
        num_string = "123456789"
        
        min_len, max_len = len(str(low)), len(str(high))
        
        for i in range(min_len, max_len + 1):
            for j in range(len(num_string) - i + 1):
                if low <= int(num_string[j:j+i]) <= high:
                    answer.append(int(num_string[j:j+i]))
                    
        return answer

GitHub - SOMJANG/CODINGTEST_PRACTICE: 1일 1문제 since 2020.02.07