LEETCODE 46: PERMUTATIONS

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

---

Python

class Solution:
    def DFS(self, extra, result, deapth):
        t_list = []
        if len(extra) == 0:
            return [result[:]]
        for idx, val in enumerate(extra):
            result[deapth] = val;
            t_list += self.DFS(extra[:idx] + extra[idx + 1:], result, deapth + 1)
        return t_list
 
    def permute(self, nums: list[int]) -> list[list[int]]:
        return self.DFS(nums, [None for _ in range(len(nums))], 0)

FeedBack

1.  

---

 

 

 

cjw.git@gmail.com