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

impl Solution {
    pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
        let mut res = Vec::new();
        Self::solve(&nums, &mut vec![], &mut res, 0);
        res
    }

    fn solve(nums: &[i32], temp: &mut Vec<i32>, res: &mut Vec<Vec<i32>>, start: usize) {
        res.push(temp.clone());
        for i in start..nums.len() {
            temp.push(nums[i]);
            Self::solve(nums, temp, res, i + 1);
            temp.pop();
        }
    }
}