LeetCode题解——Letter Combinations of a Phone Number

最新推荐文章于 2020-12-23 17:00:39 发布

susandebug

最新推荐文章于 2020-12-23 17:00:39 发布

阅读量527

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/u010025211/article/details/46882809

版权

LeetCode 专栏收录该内容

100 篇文章 0 订阅

订阅专栏

Letter Combinations of a Phone Number

Given a digit string, 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.

Input:Digit string "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

其实就是组合，比如“23”,应是两重for循环，只是将未知for循环用vector解决掉。

<span style="font-size:10px;">class Solution {
public:
    string D[10]={" "," ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};    
public:
    vector<string> letterCombinations(string digits) {
     
        vector<string> ans;
        for(int i=0;i<digits.size();i++)
        {
            int k =digits[i]-'0';
            vector<string> temp;
            for(int j=0;j<D[k].size();j++){
               if(i==0){
                    string d ;
                    d+=D[k][j];
                    temp.push_back(d);
                }
               else{
                    for(int m=0;m<ans.size();m++){
                        string d = ans[m]+D[k][j];
                        temp.push_back(d);
                    }
                }
           }
         ans = temp;
        }
        return ans;
    }
};</span>