LeetCode 第17題:Letter Combinations of a Phone Number

採用遞歸的思想。回溯法進行的暴力解法:java class Solution { public List<String> letterCombinations(String digits) { String[] table = new String[]{"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
相關文章
相關標籤/搜索