LeetCode 17. Letter Combinations of a Phone Number

最新推荐文章于 2022-11-19 15:55:23 发布

朔北冥

最新推荐文章于 2022-11-19 15:55:23 发布

阅读量241

点赞数

分类专栏： Oj 文章标签： leetcode oj string c++

本文链接：https://blog.csdn.net/emoheithree/article/details/77937881

版权

Oj 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

17. Letter Combinations of a Phone Number

Given a digit string, return all possible letter combinationsthat the number could represent.

A mapping of digit to letters (just like on the telephonebuttons) is given below.

用bfs遍历即可…

代码：

class Solution {
public:
         stringstr[10] = { "",
                   "","abc","def",
                   "ghi","jkl","mno",
                   "pqrs","tuv","wxyz"};
         vector<string>res;
         vector<string>letterCombinations(string digits) {
       if(digits.size()==0) return res;
                   charans[500];
                   bfs(digits,0, ans, 0);
                   returnres;
         }
         voidbfs(string digits, int digitsIndex, char *ans, int ansIndex) {
                   if(digitsIndex == digits.size()) {
                            ans[ansIndex]= '\0';
                            stringstr(ans);
                            res.push_back(str);
                            return;
                   }
                   inti = digits[digitsIndex] - '0';
                   for(int j = 0; j<str[i].size(); j++) {
                            ans[ansIndex]= str[i][j];
                            bfs(digits,digitsIndex + 1, ans, ansIndex + 1);
                   }
         }
};