[自我记录]随想录刷题第二十二天 | 216. 组合总和 III, 17. 电话号码的字母组合

代码随想录算法打卡第二十二天, 新手自我记录一下刷题历程, 仅为自我打卡使用.

今天两题都不难.

---

216. 组合总和 III

class Solution {
public:
    vector<vector<int>> combinationSum3(int k, int n) {
        remainder = n;
        path.clear();
        result.clear();
        backtracking(k, 1);
        return result;
    }
private:
    void backtracking(int k, int startIndex) {
        if (path.size() == k && remainder == 0) {
            result.push_back(path);
            return;
        } else if (path.size() == k) {
            return;
        } else if (remainder < 0) {
            return;
        }

        for (int i = startIndex; i <= 9 - (k - path.size()) + 1; ++i) {
            path.push_back(i);
            remainder -= i;
            backtracking(k, i + 1);
            path.pop_back();
            remainder += i;
        }
    }
    int remainder;
    vector<int> path;
    vector<vector<int>> result;
};

---

17. 电话号码的字母组合

class Solution {
public:
    vector<string> letterCombinations(string digits) {
        result.clear();
        path.clear();
        if (digits.size() > 0)
            backtracking(digits, 0);
        return result;
    }
private:
    vector<string> result;
    const string letterMap[10] = {
        "",
        "",
        "abc",
        "def",
        "ghi",
        "jkl",
        "mno",
        "pqrs",
        "tuv",
        "wxyz",
    };
    string path;
    void backtracking(string& digits, int startIndex) {
        if (path.size() == digits.size()) {
            result.push_back(path);
            return;
        }
        
        int index = digits[startIndex] - '0';
        for (int i = 0; i < letterMap[index].size(); ++i) {
            path.push_back(letterMap[index][i]);
            backtracking(digits, startIndex + 1);
            path.pop_back();
        }
    }
};

---

希望明天还能坚持!