代码随想录算法训练营 day 22 | Leetcode 77 216 17

雷达的吉兹拉斯

已于 2024-08-21 20:46:56 修改

阅读量100

点赞数 1

文章标签：算法 leetcode 职场和发展

于 2024-08-21 20:43:42 首次发布

本文链接：https://blog.csdn.net/weixin_47533957/article/details/141402536

版权

Leetcode 77 组合

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backtracking(int n, int k, int startIndex){
        if(path.size() == k){
            result.push_back(path);
            return;
        }
        for(int i = startIndex; i <= n; i++){
            path.push_back(i);
            backtracking(n, k, i + 1);
            path.pop_back();
        }
    }

public:
    vector<vector<int>> combine(int n, int k) {
        backtracking(n, k, 1);
        return result;
    }
};

Leetcode 216 组合Ⅲ

class Solution {
private:
    vector<vector<int>> result;
    vector<int> num;
    void backtracking(int k, int n, int startIndex){
        if(num.size() == k){
            int sum = 0;
            for(auto it = num.begin(); it != num.end(); it++){
                sum += *it;
            }
            if(sum == n) {
                result.push_back(num);
            }
            return;
        }
        for(int i = startIndex; i <= 9; i++){
            num.push_back(i);
            backtracking(k, n, i + 1);
            num.pop_back();
        }
        return;
    }
public:
    vector<vector<int>> combinationSum3(int k, int n) {
        backtracking(k, n, 1);
        return result;
    }
};

Leetcode 电话号码的组合

class Solution {
private:
    vector<string> result;
    string s;
    vector<string> set = {"",    "",    "abc",  "def", "ghi",
                          "jkl", "mno", "pqrs", "tuv", "wxyz"};
    void backtracking(string digits, int startIndex) {
        if (s.size() == digits.size()) {
            result.push_back(s);
            return;
        }
        //int num = stoi(digits[startIndex]);
        int num = digits[startIndex] - '0';
        for (int j = 0; j < set[num].size(); j++) {
            s += set[num][j];
            backtracking(digits, startIndex + 1);
            s.pop_back();
        }
    }

public:
    vector<string> letterCombinations(string digits) {
        if(digits.size() == 0) {return result;}
        backtracking(digits, 0);
        return result;
    }
};