[LeetCode] 47. Permutations II
Python class Solution: def permuteUnique(self, nums: List[int]) -> List[List[int]]: return set(permutations(nums, len(nums)))
최근 포스트
[LeetCode] 26. Remove Duplicates from Sorted Array
Python class Solution: def removeDuplicates(self, nums: List[int]) -> int: before = 0 for current in range(1, len(nums)): ...
[LeetCode] 46. Permutations
Python class Solution: def permute(self, nums: List[int]) -> List[List[int]]: return list(permutations(nums, len(nums)))
[LeetCode] 16. 3Sum Closest
Python class Solution: def threeSumClosest(self, nums: List[int], target: int) -> int: sorted_nums = sorted(nums) answer = sorted_nums...
[LeetCode] 7. Reverse Integer
Python class Solution: def reverse(self, x: int) -> int: if x > 0: answer = int(str(x)[::-1]) else: answer ...