leetcode 17 Letter Combinations of a Phone Number

最新推荐文章于 2020-07-24 11:09:14 发布

weixin_30918415

最新推荐文章于 2020-07-24 11:09:14 发布

阅读量134

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/qinduanyinghua/p/11428161.html

本文详细解析了一种使用回溯法解决电话号码对应字母组合的算法。通过创建数字到字母的映射，并运用递归函数，实现了从2到9所有可能的字母组合。文章提供了完整的代码实现，展示了如何遍历每一种可能的字符组合。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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"].

Note:

Although the above answer is in lexicographical order, your answer could be in any order you want.

思路：回溯法

 1 class Solution {
 2 private:
 3     // 创建映射map
 4     unordered_map<char, string> num2char {{'2', "abc"}, {'3', "def"}, {'4', "ghi"}, {'5', "jkl"},
 5                                           {'6', "mno"}, {'7', "pqrs"}, {'8', "tuv"}, {'9', "wxyz"}};
 6     
 7     void letterCombinations(vector<string> &res, string &combination, string digits, int index, int len) {
 8         if (index == len) {
 9             res.push_back(combination);
10             return;
11         }
12         //遍历第index位可以选择的字符
13         for (char c : num2char[digits[index]]) {
14             combination.push_back(c);
15             letterCombinations(res, combination, digits, index + 1, len);
16             combination.pop_back();
17         } 
18         /*
19         string current = num2char[digits[index]];
20         for (int i = 0; i < current.length(); i++) {
21             combination.push_back(current[i]);
22             letterCombinations(res, combination, digits, index + 1, len);
23             combination.pop_back();
24         } */
25     }
26 public:
27     vector<string> letterCombinations(string digits) {
28     
29         int len = digits.length();
30         vector<string> res;
31         if (len == 0) {
32             return res;
33         }
34         
35         string combination;
36         letterCombinations(res, combination, digits, 0, len);
37         return res;
38     }
39 };