Package g0001_0100.s0046_permutations

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    46 - Permutations.

    Medium

    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.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final List<List<Integer>> permute(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait