LeetCode17. 电话号码的字母组合

LeetCode17. 电话号码的字母组合

dfs回溯

class Solution {
public:
	//时间o(4^n), 空间O(4^n + n)(n为digits.length())
    vector<string> letterCombinations(string digits) {
        if(digits.length() == 0) return vector<string>();
        vector<vector<char>> d(10);
        d[0] = { };
        d[1] = { };
        d[2] = {'a', 'b', 'c'};
        d[3] = {'d', 'e', 'f'};
        d[4] = {'g', 'h', 'i'};
        d[5] = {'j', 'k', 'l'};
        d[6] = {'m', 'n', 'o'};
        d[7] = {'p', 'q', 'r', 's'};
        d[8] = {'t', 'u', 'v'};
        d[9] = {'w', 'x', 'y', 'z'};
        string cur;
        vector<string> ans;
        dfs(digits, d, 0, cur, ans);
        return ans;
    }
private:
    void dfs(const string& digits, const vector<vector<char>>& d, int k, string& cur, vector<string>& ans) {
        if(k == digits.length()) {
            ans.push_back(cur);
            return ;
        }
        for(const char val : d[digits[k] - '0']) {
            cur.push_back(val);
            dfs(digits, d, k + 1, cur, ans);
            cur.pop_back();
        }
    }
};