leetcode 回溯 17. 电话号码的字母组合 c++ 2021-07-11

class Solution {
private:
    vector<string> result;
    string path;
    const string letterMap[10] = 
    {
        "",    // 0
        "",    // 1
        "abc", // 2
        "def", // 3
        "ghi", // 4
        "jkl", // 5
        "mno", // 6
        "pqrs",// 7
        "tuv", // 8
        "wxyz",// 9
    };   
    void backTracking(string &digits, int index);

public:
    vector<string> letterCombinations(string digits) 
    {
        path.clear();
        result.clear();
        if (digits.size() == 0)
            return result;

        backTracking(digits, 0);
        return result;         
    }
};

inline void Solution::backTracking(string &digits, int index)
{
    if (index == digits.size())//index 是指 “23”中的第几个数 如果已经判断完3了，则index == digits.size() == 2就把结果保存 return结束
    {
        result.push_back(path);
        return;
    }

    int digit = digits[index] - '0';//用于判断“23”中的字符 如果是2 则digit = 2 下面就用letterMap[2]

    for (int i = 0; i < letterMap[digit].size(); ++i)
    {
        path.push_back(letterMap[digit][i]);
        backTracking(digits, index + 1);
        path.pop_back();
    }   
}