[LeetCode] 81. Search in Rotated Sorted Array II
Python class Solution: def search(self, nums: List[int], target: int) -> bool: if target in nums: return True else: ...
최근 포스트
[LeetCode] 74. Search a 2D Matrix
Python class Solution: def searchMatrix(self, matrix: List[List[int]], target: int) -> bool: for i in matrix: if target in i: ...
[LeetCode] 34. Find First and Last Position of Element in Sorted Array
Python class Solution: def searchRange(self, nums: List[int], target: int) -> List[int]: answer = [] for i in range(len(nums)): ...
[LeetCode] 349. Intersection of Two Arrays
Python class Solution: def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]: answer = [] num1, num2 = set(nums1), s...
[LeetCode] 268. Missing Number
Python class Solution: def missingNumber(self, nums: List[int]) -> int: temp = 0 for i in sorted(nums): if i != temp: ...