반응형
17. Letter Combinations of a Phone Number

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order. A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters. Example 1: Input: digits = "23" Output: ["ad","ae","af","bd","be","bf","cd","ce..
Algorithm/LeetCode Daily Challenge 2022. 5. 14. 10:30
반응형
1