代码随想录算法训练营第二十七天|93. 复原 IP 地址、78. 子集、90. 子集 II

题目链接：93. 复原 IP 地址

虽然做出来回文子串但是我还是感觉这个题足够重量级

class Solution {
public:
    string str;
    vector<string> vec;
    int num;
    vector<string> restoreIpAddresses(string s) {
        num = 0;
        backtracking(s, 0);
        return vec;
    }

    void backtracking(const string &s, int start_idx) {
        if(num > 4) return;
        if(start_idx == s.size()) {
            if(num == 4){
                str.pop_back();
                vec.push_back(str);
                str.push_back('.');
            }
            return;
        }

        for(int i = start_idx; i < s.size() && i < start_idx + 3; i++){
            string temp(s.begin() + start_idx, s.begin() + i + 1);
            if(temp.length() > 1 && temp[0] == '0') return;
            if(i == start_idx + 2 && !str_chk(temp)) return;
            temp.push_back('.');
            num++;
            str = str + temp;
            backtracking(s, i + 1);
            str.pop_back();
            num--;
            while(!str.empty() && *(str.end() - 1) != '.') str.pop_back();
        }
    }

    bool str_chk(const string& s) {
        unsigned int num = 0;
        for(int i = 0; i < s.length(); i++) {
            num *= 10;
            num += s[i] - '0';
        }
        if(num > 255) return false;
        else return true;
    } 
};

题目链接：78. 子集

class Solution {
public:
    vector<int> vec;
    vector<vector<int>> result;
    vector<vector<int>> subsets(vector<int>& nums) {
        backtracking(nums, 0);
        return result;
    }

    void backtracking(const vector<int> &nums, int start_index) {
        result.push_back(vec);
        if(start_index == nums.size()) return;

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

题目链接：90. 子集 II

class Solution {
public:
    vector<int> vec;
    vector<vector<int>> result;
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        vector<bool> used(nums.size(), false);
        backtracking(nums, 0, used);
        return result;
    }

    void backtracking(const vector<int>& nums, int start_idx, vector<bool>& used) {
        result.push_back(vec);
        if(start_idx == nums.size()) return;

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