[leetcode]46. Permutations

46. Permutations

 

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

Example:

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

class Solution(object):
    def Permute(self, cur ,nums, len_nums, result):
        if not nums:
            result.append([i for i in cur])
            return
        
        for i in range(len(nums)) :
            cur.append(nums[i])
            self.Permute(cur, nums[:i]+nums[i+1:], len_nums, result)
            cur.pop()
        return 
    
    def permute(self, nums):
        result = []
        len_nums = len(nums)
        self.Permute([] , nums, len_nums, result)
        return result        
        

https://leetcode.com/problems/permutations/