Notice
Recent Posts
Recent Comments
Link
«   2025/03   »
일 월 화 수 목 금 토
1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30 31
Tags more
Archives
Today
Total
관리 메뉴

솜씨좋은장씨

[leetCode] 1291. Sequential Digits (Python) 본문

Programming/코딩 1일 1문제

[leetCode] 1291. Sequential Digits (Python)

솜씨좋은장씨 2022. 1. 25. 00:45
728x90
반응형

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

 

Sequential Digits - 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

👨🏻‍💻 코드 ( 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

1일 1문제 since 2020.02.07. Contribute to SOMJANG/CODINGTEST_PRACTICE development by creating an account on GitHub.

github.com

저작자표시 비영리 변경금지

'Programming > 코딩 1일 1문제' 카테고리의 다른 글

[leetCode] 1945. Sum of Digits of String After Convert (Python)  (0) 2022.01.27
[leetCode] 2108. Find First Palindromic String in the Array (Python)  (0) 2022.01.26
[leetCode] 2129. Capitalize the Title (Python)  (0) 2022.01.24
[leetCode] 2114. Maximum Number of Words Found in Sentences (Python)  (0) 2022.01.23
[BaekJoon] 4378번 : 트ㅏㅊ; (Python)  (0) 2022.01.22
'Programming/코딩 1일 1문제' Related Articles more
Comments