[Leetcode] 74. Search a 2D Matrix

class Solution:
    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
        for line in matrix:
            left, right = 0, len(line) - 1

            while left <= right:
                mid = left + (right - left) // 2

                if line[mid] == target:
                    return True

                if target < line[mid]:
                    right = mid - 1
                else:
                    left = mid + 1
        return False

while left < right: 인 경우

원소가 하나인 경우를 탐색하지 못한다.