문제풀이/리트코드 (5) 썸네일형 리스트형 리트 코드 - 2D 행렬 검색 II 240번 https://leetcode.com/problems/search-a-2d-matrix-ii/ Search a 2D Matrix II - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com ** 내 풀이 import bisect from typing import List class Solution: #1 180ms, 20.5MB def searchMatrix(self, matrix: List[List[int]], target: int) -> bool: for i in.. 리트코드 - Two Sum II - Input aarray is sorted 167번 https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/ Two Sum II - Input Array Is Sorted - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com ** 내 풀이 import bisect from typing import List class Solution: # 1 225ms, 15MB def twoSum(self, numbers: List[int], target: int) -> Li.. 리트코드 - Intersection of Two Arrays 349번 https://leetcode.com/problems/intersection-of-two-arrays/ Intersection of Two Arrays - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com ** 각기 다른 풀이 import bisect from typing import List class Solution: # 1 80ms, 14MB # def intersection(self, nums1: List[int], nums2: List[int]) -> Li.. 리트 코드 - Search In Rotated Sorted Array 33번 https://leetcode.com/problems/search-in-rotated-sorted-array/ Search in Rotated Sorted Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com ** 각기 다른 풀이 import heapq from typing import List class Solution: # 1 74ms, 14.2MB # def search(self, nums: List[int], target: int) -> int: .. 리트 코드 - Binary Search 704번 https://leetcode.com/problems/binary-search/ Binary Search - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com ** 각기 다른 풀이 from bisect import bisect from typing import List import math class Solution: # 1 414ms, 15.5MB # def search(self, nums: List[int], target: int) -> int: # if tar.. 이전 1 다음