leetcode 78. 子集 c++ (回溯） 2021-07-12

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backTracking(vector<int>& nums, int count, int startIndex);

public:
    vector<vector<int>> subsets(vector<int>& nums) 
    {
        for (int j = 0; j <= nums.size(); ++j)
        {
            backTracking(nums, j, 0);
        }
        return result;
    }
};


inline void Solution::backTracking(vector<int>& nums, int count, int startIndex)
{
    if (path.size() == count)
    {
        result.push_back(path);
        return;
    }

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

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backTracking(vector<int>& nums, int startIndex);

public:
    vector<vector<int>> subsets(vector<int>& nums) 
    {

        backTracking(nums, 0);
     
        return result;
    }
};


inline void Solution::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();
    }
}