78. Subsets

Given a set of distinct integers, nums, return all possible subsets (the power set).

Note: The solution set must not contain duplicate subsets.

Example:

Input: nums = [1,2,3]
Output:
[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

class Solution {
public:

	vector<vector<int>> subsets(vector<int>& nums) {
		m_n = nums.size();
		vector<vector<int>>  ans; 
		int j ; 
		vector <int> temp;
		ans.push_back(temp); //放入一个空的  
		if (m_n == 0) return ans;  //输入为空
		ans.push_back(nums);
		if (m_n == 1) return ans; 
		
		for (int i = 1; i < m_n; ++i) //循环几个数的情况 
		{
			j = 0 ; 
			m_k = i;
			visit(nums , ans, temp, j);
		}  
		return ans;
	}

	void visit(vector<int> & nums , vector<vector<int>>  &ans, vector <int> & temp, int j)
	{
		if (temp.size() == m_k)
		{
			ans.push_back(temp);
			return;
		}
		for (int i = j; i < m_n; ++i)
		{
			temp.push_back(nums[i]);
			visit(nums , ans, temp, i + 1);
			temp.pop_back();
		}
	}
private:
	int m_n;
	int m_k;
};