[自我记录]随想录刷题第二十四天 | 93.复原IP地址, 78.子集, 90.子集II

最新推荐文章于 2024-10-17 11:39:06 发布

快毕业的中狗

最新推荐文章于 2024-10-17 11:39:06 发布

阅读量53

点赞数

分类专栏：刷题打卡自我记录文章标签：算法 leetcode c++

本文链接：https://blog.csdn.net/GM819658820/article/details/131146319

版权

刷题打卡自我记录专栏收录该内容

50 篇文章 0 订阅

订阅专栏

本文是作者在代码随想录算法打卡的记录，主要讨论了两个算法问题：93.复原IP地址，使用回溯法将给定的字符串分割成合法的IPv4地址；78.子集与90.子集II，找到给定整数数组的所有不重复子集，子集II处理了重复元素的情况。解决方案均采用递归的回溯算法实现。

摘要由CSDN通过智能技术生成

代码随想录算法打卡第二十四天, 新手自我记录一下刷题历程, 仅为自我打卡使用.

93.复原IP地址

class Solution {
public:
    vector<string> restoreIpAddresses(string s) {
        count = 0;
        result.clear();
        path.clear();
        backtracking(s, 0);
        return result;
    }
private:
    vector<string> result;
    string path;
    int count = 0;
    void backtracking(string& s, int startIndex) {
        if (startIndex == s.size() && count == 4) {
            path.pop_back();
            result.push_back(path);
            return;
        } else if (count == 4) return;

        for (int i = startIndex; i < s.size() && i < startIndex + 3; ++i) {
            if (s[startIndex] == '0' && i > startIndex) {
                continue;
            }
            string sub = s.substr(startIndex, i - startIndex + 1);
            if (i == startIndex + 2 && (stoi(sub) > 255)) {
                continue;
            }
            
            path += sub;
            path.push_back('.');
            count++;
            backtracking(s, i + 1);
            count--;
            int size = sub.size();
            while (size) {
                path.pop_back();
                size--;
            }
            if (path[path.size() - 1] != '.')
                path.pop_back();
        }
    }
};

78. 子集

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        result.clear();
        path.clear();
        backtracking(nums, 0);
        return result;
    }
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) {
            path.push_back(nums[i]);
            backtracking(nums, i + 1);
            path.pop_back();
        }
    }
};

90.子集II

class Solution {
public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        result.clear();
        path.clear();
        sort(nums.begin(), nums.end());
        backtracking(nums, 0);
        return result;
    }
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]) {
                continue;
            }
            path.push_back(nums[i]);
            backtracking(nums, i + 1);
            path.pop_back();
        }
    }
};

希望出门前再坚持几天!