zl程序教程

您现在的位置是:首页 >  其他

当前栏目

17. 电话号码的字母组合

2023-04-18 16:11:27 时间

思路:

分路递归,每次取一路可能拿到的字符加到字符串最后,直到字符串长度和咱们传入数组长度相同,加入数组。

代码:

   class Solution {
        String[] letter_map = {" ", "*", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};

        public List<String> letterCombinations(String digits) {
            List<String> res = new LinkedList<>();
            if (digits.length() < 1) {
                return res;
            }

            char[] chars = digits.toCharArray();
            getAllLetter("", chars, res);
            return res;
        }

        private void getAllLetter(String currStr, char[] chars, List<String> res) {
            if (currStr.length() == chars.length) {
                res.add(currStr);
                return;
            }

            int currNum = chars[currStr.length()] - '0';

            String charStr = letter_map[currNum];

            for (char c : charStr.toCharArray()) {
                getAllLetter(currStr+String.valueOf(c),chars,res);
            }
        }
    }