Categories
Uncategorized

78. Subsets Leetcode Javascript Solution

The Problem:

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.

The Solution:

We use backtracking for this problem.

var subsets = function(nums) {
    let results = []
    nums.sort()
    backtrack(nums,0,results,new Array())
    function backtrack(nums, start, results, temp){
        results.push([...temp])
        for(let i = start; i < nums.length; i++){
            temp.push(nums[i])
            backtrack(nums,i+1,results,temp)
            temp.pop()
        }
    }
    return results
};

Leave a Reply

Your email address will not be published. Required fields are marked *