Letter Combinations of a Phone Number - Leetcode

题意：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.

方法一：直接循环求解。题目不算难，关键在于如何得到所有的组合。例如，我们输入“23”。首先将2对应的字符存入到res中{“a”,”b”,”c”}，随后将”a”删除，a与3对应的字符组合存入到res{“b”,”c”,”ad”,”ae”,”af”}。最后得到{“ad”, “ae”, “af”, “bd”, “be”, “bf”, “cd”, “ce”, “cf”}。

class Solution {
public:
    vector<string> letterCombinations(string digits) {
        vector<string> letter={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
        vector<string> res;
        if(digits.size()==0) return res;
        res.push_back("");
        for(int i=0;i<digits.size();i++)
        {
            int size=res.size();
            for(int j=0;j<size;j++)
            {
                string cur=res[0];
                res.erase(res.begin());
                for(int k=0;k<letter[digits[i]-'0'].size();k++)
                {
                    res.push_back(cur+letter[digits[i]-'0'][k]);
                }
            }
        }
        return res;

    }
};

方法二：递归。从网上查到的方法，笔者还不太会写递归程序。本题递归算法列出所有的解。

const string letters[10] = {" ", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};

class Solution 
{
public:
    vector<string> result;
    //递归函数，得到第一个数字对应的第一个字符后进入第二个数字
    void aletter(string digits, string temp)
    {
        if(!digits.length())
        {
            result.push_back(temp);
        }
        else
        {
            int index = digits[0] - '0';
            for(int i=0; i<letters[index].length(); i++)
            {
                temp += letters[index][i];
                aletter(digits.substr(1),temp);
                temp = temp.substr(0,temp.length()-1);

            }
        }
    }

    vector<string> letterCombinations(string digits)
    {
        result.clear();
        if(digits.size()==0) return result;
        aletter(digits, "");
        return result;
    }

};