LeetCode Letter Combinations of a Phone Number DFS

DFS

C++ code:

class Solution {
private:
    vector<string> mapping = {"abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
public:
    vector<string> letterCombinations(string digits) {
        vector<string> res;
        if(digits.size() == 0) return res;
        int index = 0;
        string value = "";
        dfs(index, digits, res, value);
        return res;
    }
    void dfs(int index, string digits, vector<string>& res, string& value) {
        if(index == digits.size()) {
            res.push_back(value);
            return;
        }
        for(int i = 0; i < mapping[digits[index] - '2'].size(); ++i) {
            value.push_back(mapping[digits[index] - '2'][i]);
            dfs(index + 1, digits, res, value);
            value.pop_back();
        }
    }
};

精简后：

class Solution {
public:
    const vector<string> dict={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};

    void dfs(string digits, int depth, string path, vector<string> &res) {
        if(depth == digits.size()) {
            res.push_back(path);
            return;
        }
        for(auto c: dict[digits[depth] - '0']) {
            dfs(digits, depth+1, path+c, res);
        }
    }

    vector<string> letterCombinations(string digits) {
        vector<string> res;
        if(digits.size() == 0) return res;
        dfs(digits, 0, "", res);
        return res;
    }
};