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

Note:

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

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

描述：把电话键盘上的数字串映射成可能的字符串

解法：BFS，初始状态为空字符串，用滚动数组实现

solution by python:

class Solution:
    # @return a list of strings, [s1, s2]
    def letterCombinations(self, digits):
        ans = [[''],[]]
        nmap= ['','','abc','def','ghi','jkl','mno','pqrs','tuv','wxyz']
        idx = 0
        for digit in digits:
            for c in nmap[int(digit)]:
                for ele in ans[idx]:
                    ans[1-idx].append(ele+c)
            idx = 1-idx
            ans[1-idx]=[]
        return ans[idx]

solution by c++:

class Solution {
public:
    vector<string> letterCombinations(string digits) {
        wmap['1']=""; wmap['2']="abc"; wmap['3'] = "def";
        wmap['4']="ghi"; wmap['5']="jkl"; wmap['6']="mno";
        wmap['7']="pqrs"; wmap['8']="tuv"; wmap['9']="wxyz";
        vector<vector<string> > ans(2);
        ans[0].push_back("");
        bool flag = 0;
        for(int i=0; i<digits.size(); i++){
            for(string str : ans[flag]){
                for(int j=0; j< wmap[digits[i]].size(); j++)
                    ans[1-flag].push_back(str+wmap[digits[i]][j]);
            }
            flag = 1-flag;
            ans[1-flag].clear();
        }
        return ans[flag];
    }
private:
    unordered_map<char,string> wmap;
};