【leetcode】【medium】17. Letter Combinations of a Phone Number​​​​​​​

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

Note:

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

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

 

思路

循环迭代。

法一：递归

class Solution {
public:
    unordered_map<char, vector<string>> letter = {
        {'2',{"a","b","c"}},
        {'3',{"d","e","f"}},
        {'4',{"g","h","i"}},
        {'5',{"j","k","l"}},
        {'6',{"m","n","o"}},
        {'7',{"p","q","r","s"}},
        {'8',{"t","u","v"}},
        {'9',{"w","x","y","z"}}
    };
    vector<string> letterCombinations(string digits) {
        vector<string> res;
        if(digits.size()<=0){
            return res;
        } 
        vector<string> record = letterCombinations(digits.substr(0,digits.size()-1));
        vector<string> tmp = letter[digits.back()];
        if(record.size()<=0) return tmp;
        for(int i = 0; i<record.size(); ++i){
            for(int j = 0; j<tmp.size(); ++j){
                res.push_back(record[i]+tmp[j]);
            }
        }
        return res;
    }
};

法二：非递归

暂不写