Leetcode_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.

题目意思：就是给一串字符串，然后看有多少组合。

思路：用回溯解决，每次取一个字母，然后进行递归。

代码：

class Solution {
public:
    void backTrace(string digits,vector<string>dict,string& curres,vector<string> &res)
    {
        int pos = curres.length();
        if(pos==digits.length())
        {
            res.push_back(curres);
            return;
        }
        int num = digits[pos]-'0';
        int cnt = dict[num].length();
        for(int i=0;i<cnt;i++)
        {
            curres += dict[num][i];
            backTrace(digits,dict,curres,res);
            curres.pop_back();
        }
    }

    vector<string>letterCombinations(string digits)
    {
        initializer_list<string> lst = {"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxzy"}; 
        //序号为0,1的没有对应的字母
        vector<string>dict(lst);
        vector<string>res;
        if(digits.length()==0)  return res;
        string curres = "";
        backTrace(digits,dict,curres,res);
        return res;
    }
};