Subsets

标签：leetcode

<span style="font-family: Arial, Helvetica, sans-serif;">void findsubsets(vecvoid findsubsets(vector<int> partOne,int i,vector<int>& nums);</span>

class Solution {
public:
	vector<vector<int>> subsetsAnswer;//globle variable.
	vector<vector<int>> subsets(vector<int>& nums)
	{
		sort(nums.begin(),nums.end());


		vector<int> partOne;
		findsubsets(partOne,0,nums);


		return subsetsAnswer;
	}
	void findsubsets(vector<int> partOne,int i,vector<int>& nums)
	{
		//这个递归就不太明白了?
		if(i==nums.size())
		{
			subsetsAnswer.push_back(partOne);
			return;
		}else
		{
			findsubsets(partOne,i+1,nums);
			partOne.push_back(nums[i]);
			findsubsets(partOne,i+1,nums);


		}
	}
};

Subsets

标签：leetcode

原文地址：http://blog.csdn.net/q286989429/article/details/47359983