Leetcode 46. Permutations

Leetcode 46. Permutations

Permutations - LeetCode

Permutations - LeetCode

Logic

1. DFS로 깊이탐색
2. prev는 추가되고 next는 줄어들면서 dfs를 돈다

Solution

from typing import List

class Solution:
    def permute(self, nums: List[int]) -> List[List[int]]:
        prev = []
        answer = []
        def dfs(elements: List[int]):
            if len(elements) == 0:
                answer.append(prev[:])

            for e in elements:
                next = elements[:]
                prev.append(e)
                next.remove(e)
                dfs(next)
                prev.pop()

        dfs(nums)
        return answer