Day27| 93 复原IP地址 78 子集 90 子集II

最新推荐文章于 2024-06-12 10:00:23 发布

蝶海梦花、

最新推荐文章于 2024-06-12 10:00:23 发布

阅读量1k

点赞数 3

文章标签：算法

本文链接：https://blog.csdn.net/m0_74082772/article/details/136276499

版权

93 复原IP地址

78 子集

90 子集II

93 复原IP地址

class Solution {
public:
    vector<string> result;

    void backtracking(string s, int startindex, int pointnum){
        if(pointnum == 3){
            if(isvaild(s, startindex, s.size()-1)){
                result.push_back(s);
                return;
            }
        }

        for(int i = startindex; i < s.size(); i++){
        
            if(isvaild(s, startindex, i)){
                s.insert(s.begin()+i+1, '.');
                pointnum++;
                backtracking(s, i+2, pointnum);
                pointnum--;
                s.erase(s.begin()+i+1);
            }else break;
        }
    }

    bool isvaild(const string &s, int start, int end){
        if(start > end){
            return false;
        }

        if(s[start] == '0' && start != end){
            return false;
        }

        int num = 0;
        for(int i = start; i <= end; i++){
            if(s[i] < '0' || s[i] > '9'){
                return false;
            }
            num = num*10 + s[i]-'0';
            if(num > 255){
                return false;
            }
        }
        return true;
    }

    vector<string> restoreIpAddresses(string s) {
        if(s.size() < 4 || s.size() > 12) return result;
        backtracking(s, 0, 0);
        return result;
    }
};

78 子集

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;

    void backtracking(vector<int>& nums, int startIndex){
        if(startIndex > nums.size()){
            result.push_back(path);
            return;
        }

        for(int i = startIndex; i < nums.size(); i++){
            path.push_back(nums[i]);
            result.push_back(path);
            backtracking(nums, i+1);
            path.pop_back();
        }

    }

    vector<vector<int>> subsets(vector<int>& nums) {
        result.push_back(path);
        backtracking(nums, 0);
        return result;
    }
};

90 子集II

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;

    void backtracking(const vector<int>& nums, int startindex, vector<bool> used){
        if(startindex > nums.size()){
            result.push_back(path);
            return;
        }

        for(int i = startindex; i < nums.size(); i++){
            if(i > 0 && nums[i] == nums[i-1] && used[i-1] == false){
                continue;
            }
            path.push_back(nums[i]);
            result.push_back(path);
            used[i] = true;
            backtracking(nums, i+1, used);
            path.pop_back();
            used[i] = false;
        }
    }

    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        result.push_back(path);
        vector<bool> used(nums.size(), false);
        sort(nums.begin(), nums.end());
        backtracking(nums, 0, used);
        return result;
    }
};