개발자 (1) 썸네일형 리스트형 [LeetCode] Letter Combinations of a Phone Number - medium level Problem Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. 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 Input: "23" Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]. Solution medium level의 문제의 난이도가 생각보다 변동폭이 큰 것 같다. 이 문제도 .. 이전 1 다음
