从零开始的LC刷题(119): Letter Combinations of a Phone Number

原题：

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

输入一串数字，找出对应九宫格输入法的所有可能的输出（即排列组合），方法是只要每次接着上次的输出在末尾加上可能的字符就行，结果：

Success

Runtime: 0 ms, faster than 100.00% of C++ online submissions for Letter Combinations of a Phone Number.

Memory Usage: 8.7 MB, less than 62.86% of C++ online submissions for Letter Combinations of a Phone Number.

代码：

class Solution {
public:
    vector<string> letterCombinations(string digits) {
        if(!digits.size()){vector<string> s;return s;}
        vector<string> re{""};
        vector<vector<char>> dial{{'a','b','c'},{'d','e','f'},{'g','h','i'},{'j','k','l'},{'m','n','o'},{'p','q','r','s'},{'t','u','v'},{'w','x','y','z'}};
        vector<int> dialnum{3,3,3,3,3,4,3,4};
        for(int i=0;i<digits.size();i++){
            int index=digits[i]-'0'-2;
            vector<string> temp;
            for(int j=0;j<re.size();j++){
                for(int k=0;k<dialnum[index];k++){
                    string neo=re[j]+dial[index][k];
                    temp.push_back(neo);
                }
            }
            re=temp;
        }
        return re;
    }
};

看解法和我一个意思