일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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
- DWG
- data science
- Convert Sorted List to Binary Search Tree
- 715. Range Module
- 파이썬
- Substring with Concatenation of All Words
- Regular Expression
- Generator
- 밴픽
- concurrency
- 43. Multiply Strings
- iterator
- LeetCode
- 109. Convert Sorted List to Binary Search Tree
- shiba
- 운영체제
- kaggle
- 30. Substring with Concatenation of All Words
- 프로그래머스
- 시바견
- Protocol
- Python
- t1
- Python Implementation
- Class
- Decorator
- attribute
- Python Code
- 컴퓨터의 구조
- 315. Count of Smaller Numbers After Self
Archives
- Today
- Total
목록Letter Combinations of a Phone Number (1)
Scribbling
LeetCode: 17. Letter Combinations of a Phone Number
class Solution: def letterCombinations(self, digits: str) -> List[str]: if not digits: return [] ret_list = [] x = [ [], [], ['a', 'b', 'c'], ['d', 'e', 'f'], ['g', 'h', 'i'], ['j', 'k', 'l'], ['m', 'n', 'o'], ['p', 'q', 'r', 's'], ['t', 'u', 'v'], ['w', 'x', 'y', 'z'], ] def save_comb(digits, string): if not digits: ret_list.append(string) return char_list = x[int(digits[0])] for char in char_l..
Computer Science/Coding Test
2021. 8. 21. 15:10