46. Permutations (Medium) class Solution: def permute(self, nums: List[int]) -> List[List[int]]: res =[] s=[] v ={i: False for i in nums} def dfs(): if len(s)==len(nums): res.append(s[:]) return else: for i in nums: if not v[i]: s.append(i) v[i] = True .. Dev/Algorithm 2024.11.11
