代码随想录day24 93.复原IP地址 、 78.子集 、90.子集II

代码随想录day24 93.复原IP地址 、 78.子集 、90.子集II

93.复原IP地址

代码随想录

好难，感觉得刷几遍才行

class Solution {
public:

    vector<string> res;
    void traversal(string &s, int startIndex, int pointNum) {
        if (pointNum == 3) {
            if (isValid(s, startIndex, s.size() - 1)) {
                res.push_back(s);
            }
            return;
        }
        for (int i = startIndex; i < s.size(); i++) {
            if (isValid(s, startIndex, i)) {
                s.insert(s.begin() + i + 1, '.');
                traversal(s, i + 2, pointNum + 1);
                s.erase(s.begin() + i + 1);
            } else {
                break;
            }
        }
    }

    bool isValid(const string &s, int startIndex, int endIndex) {
        if (startIndex > endIndex) {
            return false;
        }
        if (s[startIndex] == '0') {
            return startIndex == endIndex;
        } 
        int num = 0;
        for (int i = startIndex; i <= endIndex; i++) {
            if (!isdigit(s[i])) {
                return false;
            }
            num = 10 * num + (s[i] - '0');
            if (num > 255) {
                return false;
            }
        }
        return true;
    }


    vector<string> restoreIpAddresses(string s) {
        traversal(s, 0, 0);
        return res;
    }
};

78.子集

代码随想录

class Solution {
public:

    vector<vector<int>> res;
    vector<int> path;
    void traversal(vector<int> & nums, int startIndex) {
        res.push_back(path);
        if (startIndex == nums.size()) {
            return;
        }
        for (int i = startIndex; i < nums.size(); i++) {
            path.push_back(nums[i]);
            traversal(nums, i + 1);
            path.pop_back();
        }
    }

    vector<vector<int>> subsets(vector<int>& nums) {
        res.clear();
        path.clear();
        traversal(nums, 0);
        return res;
    }
};

90.子集II

代码随想录

class Solution {
public:

    vector<vector<int>> res;
    vector<int> path;
    void traversal(vector<int> & nums, int startIndex) {
        res.push_back(path);
        if (startIndex == nums.size()) {
            return;
        }
        for (int i = startIndex; i < nums.size();) {
            path.push_back(nums[i]);
            traversal(nums, i + 1);
            path.pop_back();
            i++;
            while(i < nums.size() && nums[i] == nums[i - 1]) {
                i++;
            }
        }
    }

    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        res.clear();
        path.clear();
        traversal(nums, 0);
        return res;
    }
};

卡哥的

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backtracking(vector<int>& nums, int startIndex) {
        result.push_back(path);
        for (int i = startIndex; i < nums.size(); i++) {
            // 而我们要对同一树层使用过的元素进行跳过
            if (i > startIndex && nums[i] == nums[i - 1] ) { // 注意这里使用i > startIndex
                continue;
            }
            path.push_back(nums[i]);
            backtracking(nums, i + 1);
            path.pop_back();
        }
    }

public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        result.clear();
        path.clear();
        sort(nums.begin(), nums.end()); // 去重需要排序
        backtracking(nums, 0);
        return result;
    }
};