[leetcode]78. Subsets

[leetcode]78. Subsets

---

Analysis

等国庆等国庆！！！！！—— [每天刷题并不难]

Given a set of distinct integers, nums, return all possible subsets (the power set).
Note: The solution set must not contain duplicate subsets.

比较经典的一个求子串的问题，用DFS解决。

Implement

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        vector<int> tmpset;
        if(nums.size() == 0)
            return res;
        DFS(0, nums, tmpset);
        return res;
    }
    void DFS(int start, vector<int>& nums, vector<int>& tmpset){
        res.push_back(tmpset);
        for(int i=start; i<nums.size(); i++){
            tmpset.push_back(nums[i]);
            DFS(i+1, nums, tmpset);
            tmpset.pop_back();
        }
    }
private:
    vector<vector<int>> res;
};