DFS专题--【LeetCode】17. Letter Combinations of a Phone Number

 

Input:Digit string "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

中心思想：找出input digit string对应的数字的全部集合。本质就是若干for循环。

dfs类题目，可以把要输出的结果（比如此题目的string result 和 vector<string> solutions）定义为全局变量，这样可以减少dfs函数体的参数。

code:

    string result;
    vector<string> solutions;
    vector<string> digitsMap = {" ", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
    
    vector<string> letterCombinations(string digits){
        if(digits.size() == 0) return solutions;
        int len = digits.size();
        dfs(0, len, digits, result, solutions);
        return solutions;
    }
    
    void dfs(int start, const int len, string& digits, string result, vector<string>& solutions){
        //返回条件：
        if(start == len){
            solutions.push_back(result);
            return;
        }
        
        //写扩展
     //   for(int i = 0; i < digitsMap[digits[start]-'0'].size(); i++){
        for(auto c : digitsMap[digits[start]-'0']){
          //  result += digitsMap[digits[start]-'0'][i];
         //   string c = digitsMap[digits[start]-'0'].substr(i, 1);
        //    result.append(c);
        //    result += c;
            dfs(start+1, len, digits, result+c, solutions);
        }
    }