Leetcode 74. Search a 2D Matrix (python+cpp)

题目

解法：二分搜索

可以根据大小关系直接降成一维，然后二分搜索

class Solution:
    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
        if not matrix or not matrix[0]:
            return False
        arr = []
        for row in matrix:
            arr += row
            
        lo = 0
        hi = len(arr)-1
        #print(arr)
        
        while lo+1<hi:
            mid = lo+(hi-lo)//2
            #print(arr[mid])
            if arr[mid] == target:
                return True
            elif arr[mid]<target:
                lo = mid
            else:
                hi = mid
        
        if arr[lo]==target or arr[hi]==target:
            return True
        else:
            return False

也可以根据每个元素的位置索引与函数和列数的关系来直接二分搜索
假设matrix有m行，n列，当前元素按照大小排在第k个，那么当前元素在matrix中的行数为r=k/n，列数为c=k%n

class Solution:
    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
        if not matrix or not matrix[0]:
            return False
        m,n = len(matrix),len(matrix[0])
            
        lo = 0
        hi = m*n-1
        #print(arr)
        
        while lo+1<hi:
            mid = lo+(hi-lo)//2
            r = mid//n
            c = mid%n
            #print(arr[mid])
            if matrix[r][c] == target:
                return True
            elif matrix[r][c]<target:
                lo = mid
            else:
                hi = mid
        
        if matrix[lo//n][lo%n]==target or matrix[hi//n][hi%n]==target:
            return True
        return False

C++版本：

public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        if (matrix.size()==0 || matrix[0].size()==0) return false;
        int m = matrix.size(), n = matrix[0].size();
        int mid, lo=0,hi= m*n - 1,r,c;
        while (lo+1<hi){
            mid = lo + (hi - lo)/2;
            r = mid/n;
            c = mid%n;
            if (matrix[r][c]==target){
                return true;
            }else if (matrix[r][c]<target){
                lo = mid;
            }else {
                hi = mid;
            }
        }
        
        if (matrix[lo/n][lo%n]==target || matrix[hi/n][hi%n]==target){
            return true;
        }
        return false;
    }
};

二刷解法，logn复杂度，n为列数

通过每行第一个元素和最后一个元素定位到target在哪一行，然后对特定一行做二分搜索即可

class Solution:
    def binary_search(self,row,target):
        l = 0
        r = len(row)
        while l + 1 < r:
            mid = l + (r - l) // 2
            if row[mid] <= target:
                l = mid
            else:
                r = mid
        return True if row[l] == target else False
    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
        if matrix[0][0] > target or matrix[-1][-1] < target:
            return False
        for i in range(len(matrix)):
            # find which row that the target might be in
            row = matrix[i]
            if row[0] <= target and row[-1] >= target:
                if self.binary_search(row,target):
                    return True
                break
        return False