Subsets
原题链接Subsets
给定一个数组序列,找出所有子序列
深度优先扫一遍:)
class Solution {
public:
vector<vector<int>> subsets(vector<int>& nums) {
vector<vector<int>> res;
vector<int> cur;
dfs(0, nums, cur, res);
return res;
}
private:
void dfs(int i, vector<int>& nums,