代码随想录训练营day24|回溯算法part3

weixin_45831563

于 2024-07-28 13:57:38 发布

阅读量158

点赞数 4

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

本文链接：https://blog.csdn.net/weixin_45831563/article/details/140750043

版权

复原IP地址

力扣题目链接

class Solution {
public:
    vector<int> path;
    vector<string> result;
    vector<string> restoreIpAddresses(string s) {
        backtracking(s, 0);
        return result;
    }
    void backtracking(string s, int index){
        if(index == s.length() && path.size() == 4){
            string str;
            for(int i = 0; i < 4; i++){
                str.append(std::to_string(path[i]));
                str.push_back('.');
            }
            str.pop_back();
            result.push_back(str);
        }
        else if(path.size() > 4){
            return;
        }
        int num = 0;
        for(int i = index; i < s.length(); i++){
            num = num * 10 + s[i]-'0';
            if(num == 0){//前导0
                path.push_back(num);
                backtracking(s, i + 1);
                path.pop_back();
                break;//退出
            }
            else if(num > 0 && num <= 255){
                path.push_back(num);
                backtracking(s, i + 1);
                path.pop_back();                
            }
            else{
                break;
            }
        }
    }
};

子集

力扣题目链接

class Solution {
public:
    vector<int> path;
    vector<vector<int>> result;
    vector<vector<int>> subsets(vector<int>& nums) {
        backtracking(nums, 0);
        return result;
    }
    void backtracking(vector<int> &nums, int index){
        result.push_back(path);
        for(int i = index; i < nums.size(); i++){
            path.push_back(nums[i]);
            backtracking(nums, i+1);
            path.pop_back();
        }
    }
};

子集II

力扣题目链接

class Solution {
public:
    vector<int> path;
    vector<vector<int>> result;
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        vector<bool> used(nums.size(), false);
        sort(nums.begin(), nums.end());
        backtracking(nums, 0, used);
        return result;
    }
    void backtracking(vector<int>& nums, int index, vector<bool>& used){
        result.push_back(path);
        for(int i = index; i < nums.size(); i++){
            if(i > 0 && nums[i] == nums[i-1] && !used[i-1]){
                continue;
            }
            used[i] = true;
            path.push_back(nums[i]);
            backtracking(nums, i+1, used);
            path.pop_back();
            used[i] = false;
        }
    }
};