LeetCode-in-All

78. Subsets

Medium

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:

Solution

using System.Collections.Generic;

public class Solution {
    public IList<IList<int>> Subsets(int[] nums) {
        IList<IList<int>> res = new List<IList<int>>();
        Solve(nums, new List<int>(), res, 0);
        return res;
    }

    private void Solve(int[] nums, List<int> temp, IList<IList<int>> res, int start) {
        res.Add(new List<int>(temp));
        for (int i = start; i < nums.Length; i++) {
            temp.Add(nums[i]);
            Solve(nums, temp, res, i + 1);
            temp.RemoveAt(temp.Count - 1);
        }
    }
}