[리트코드 leetcode] 46. Permutations

Permutations - LeetCode

Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

leetcode.com

class Solution:
    def permute(self, nums: List[int]) -> List[List[int]]:
        
        results=[]
        
        def dfs(result=[],next=[]):
            
            if len(result)==len(nums):
                results.append(result[:])
                return
            
            for i in range(len(next)):
                temp = result.copy()
                temp.append(next[i])
                next_list = next.copy()
                next_list.remove(next_list[i])
                dfs(temp,next_list)  
        
        dfs([],nums.copy())
        return results

class Solution:
    def permute(self, nums: List[int]) -> List[List[int]]:
        
        result = []
        
        def dfs(lst=[]):
            if len(lst)==len(nums):
                result.append(lst)
                return
            
            for num in nums:
                if not num in lst:
                    dfs(lst+[num])
            
        dfs()
        return result