mirror of
https://github.com/devenperez/leetcode.git
synced 2026-06-13 14:57:08 +00:00
Deven
26 lines
579 B
Python
26 lines
579 B
Python
class Solution:
|
|
def letterCombinations(self, digits: str) -> List[str]:
|
|
mapping = {
|
|
"2": "abc",
|
|
"3": "def",
|
|
"4": "ghi",
|
|
"5": "jkl",
|
|
"6": "mno",
|
|
"7": "pqrs",
|
|
"8": "tuv",
|
|
"9": "wxyz"
|
|
}
|
|
|
|
curr = [""]
|
|
next = []
|
|
|
|
for digit in digits:
|
|
for prefix in curr:
|
|
for newChar in mapping[digit]:
|
|
next.append(f"{prefix}{newChar}")
|
|
curr = next
|
|
next = []
|
|
|
|
return curr
|
|
|
|
|