leetcode 078 —— Subsets

Given a set of distinct integers, nums, return all possible subsets.

Note:

• Elements in a subset must be in non-descending order.
• The solution set must not contain duplicate subsets.

For example,
If nums = [1,2,3], a solution is:

[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

思路：回溯法

class Solution {
public:
	vector<vector<int>> subsets(vector<int>& nums) {
		sort(nums.begin(), nums.end());
		vector<vector<int>> res;
		vector<int> path;
		res.push_back(path);
		scan(0, path, nums, res);
		return res;
	}
	void scan(int level, vector<int> &path, vector<int> &nums, vector<vector<int>> &res){
		if (level == nums.size())
			return;
		for (int i = level; i < nums.size(); i++){
			path.push_back(nums[i]);
			res.push_back(path);
			scan(i+ 1, path, nums, res);
			path.pop_back();
		}
	}
};