LeetCode Link: 778. Subsets
Language: C#
Problem Statement
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.
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]]
Constraints:
1 <= nums.length <= 10 -10 <= nums[i] <= 10 All the numbers of nums are unique.
Solution
public class Solution
{
public IList<IList<int>> Subsets(int[] nums)
{
var list = new List<IList<int>>();
BT(list, new List<int>(), nums, 0);
return list.ToList();
}
private void BT(List<IList<int>> list, List<int> temp, int[] nums, int index)
{
if (index > nums.Length)
{
return;
}
var l = new List<int>(temp);
list.Add(l);
for (int i=index; i<nums.Length; i++)
{
temp.Add(nums[i]);
BT(list, temp, nums, i+1);
temp.Remove(nums[i]);
}
}
}