46. Permutations

Given a collection of distinct numbers, return all possible permutations.

For example,
[1,2,3] have the following permutations:

[
  [1,2,3],
  [1,3,2],
  [2,1,3],
  [2,3,1],
  [3,1,2],
  [3,2,1]
]
class Solution(object):
    def permute(self, nums):
        return list(itertools.permutations(nums,len(nums)))
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        

你可能感兴趣的:(46. Permutations)