Categories
Uncategorized

46. Permutations Leetcode Javascript Solution

The Problem:

Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.

Example 1:

Input: nums = [1,2,3]
Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]

Example 2:

Input: nums = [0,1]
Output: [[0,1],[1,0]]

Example 3:

Input: nums = [1]
Output: [[1]]

Constraints:

  • 1 <= nums.length <= 6
  • -10 <= nums[i] <= 10
  • All the integers of nums are unique.

The Solution:

We use backtracking:

var permute = function(nums) {
  let results = []
  function backtrack(nums, results, temp){
      if(temp.length == nums.length){
          results.push([...temp])
      }
      for(let i = 0 ; i < nums.length; i++){
          if(temp.includes(nums[i])){continue}
          temp.push(nums[i])
          backtrack(nums,results,temp)
          temp.pop()
      }
  }
    backtrack(nums,results, new Array())
    return results
};

Leave a Reply

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