Permutations (Not Unique)

PHOTO EMBED

Thu Mar 10 2022 02:20:47 GMT+0000 (Coordinated Universal Time)

Saved by @vijuhiremath #python #template #permutations

# nums = list

class Solution:
    def permute(self, nums: List[int]) -> List[List[int]]:
        res = []
        self.dfs(nums, [], res)
        return res

    def dfs(self, nums, path, res):
        if not nums:
            res.append(path)
            #return # backtracking
        for i in range(len(nums)):
            self.dfs(nums[:i]+nums[i+1:], path+[nums[i]], res)
content_copyCOPY

https://leetcode.com/problems/combination-sum/discuss/429538/General-Backtracking-questions-solutions-in-Python-for-reference-%3A