[LeetCode] 287. Find the Duplicate Number
Python class Solution: def findDuplicate(self, nums: List[int]) -> int: temp = Counter(nums) for i, v in temp.items(): if ...
최근 포스트
[LeetCode] 33. Search in Rotated Sorted Array
Python class Solution: def search(self, nums: List[int], target: int) -> int: if target in nums: return nums.index(target) ...
[LeetCode] 217. Contains Duplicate
Python class Solution: def containsDuplicate(self, nums: List[int]) -> bool: if len(nums) == len(set(nums)): return False ...
[LeetCode] 70. Climbing Stairs
Python class Solution: @lru_cache def climbStairs(self, n: int) -> int: if n == 0 or n == 1: return 1 return...
[LeetCode] 509. Fibonacci Number
Python class Solution: def fib(self, n: int) -> int: a, b = 0, 1 for i in range(n): a, b = a + b, a r...