Given an integer array nums of unique elements, return all possible subsets (the power set).
The solution set must not contain duplicate subsets. Return the solution in any order.
Test Cases
Example 1:
Input: nums = [1,2,3]
Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]
Example 2:
Input: nums = [0]
Output: [[],[0]]
Solution
class Solution {
public:
vector<vector<int>> subsets(vector<int>& nums) {
vector<vector<int>> result;
vector<int> subset = {};
backtrack(nums, result, subset, 0);
return result;
}
void backtrack(vector<int>& nums, vector<vector<int>>& result, vector<int>& subset, int pos) {
result.push_back(subset);
for(int i=pos; i<nums.size(); i++) {
subset.push_back(nums[i]);
backtrack(nums, result, subset, i+1);
subset.pop_back();
}
}
};class Solution {
public List<List<Integer>> subsets(int[] nums) {
List<List<Integer>> res = new ArrayList<>();
backtrack(nums, res, new ArrayList<>(), 0);
return res;
}
private void backtrack(int[] nums, List<List<Integer>> res, List<Integer> subset, int pos) {
res.add(new ArrayList<>(subset));
for(int i=pos; i<nums.length; i++) {
subset.add(nums[i]);
backtrack(nums, res, subset, i+1);
subset.remove(subset.size() - 1);
}
}
}