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"};
相关文章
相关标签/搜索