Leetcode 17. Letter Combinations of a Phone Number

最新推荐文章于 2024-07-09 23:43:07 发布

北城路人

最新推荐文章于 2024-07-09 23:43:07 发布

阅读量463

点赞数

分类专栏：算法打卡文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/weixin_42542290/article/details/127937926

版权

算法打卡专栏收录该内容

55 篇文章 0 订阅

订阅专栏

题目链接：https://leetcode.cn/problems/letter-combinations-of-a-phone-number/

方法一回溯

1 方法思想

2 代码实现

class Solution {
    String[] nums = new String[]{"","","abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
    List<String> result = new ArrayList<>();
    StringBuffer str = new StringBuffer();

    public List<String> letterCombinations(String digits) {
        if(digits.length() == 0) return result;
        backTracking(digits, 0);
        return result;
    }
    public void backTracking(String digits, int start){
        if (start == digits.length()) {
            result.add(new String(str));
            return;
        }
        int numsIndex = digits.charAt(start) - '0';
        for (int j = 0; j < nums[numsIndex].length(); j++) {
            str.append(nums[numsIndex].charAt(j));
            backTracking(digits, start + 1);
            str.deleteCharAt(str.length() - 1);
        }
    }

}