【LeetCode】求给定值在排好序的二维数组中是否存在：Search a 2D Matrix

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

• Integers in each row are sorted from left to right.
• The first integer of each row is greater than the last integer of the previous row.

Example 1:

Input:
matrix = [
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]
target = 3
Output: true

Example 2:

Input:
matrix = [
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]
target = 13
Output: false

代码如下：

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        if(matrix.empty() || matrix[0].empty()) return false;
        
        int start = 0, end = matrix.size();
        // 遍历第一列，找到第一行比目标值大的行，其上一行是目标值可能出现的行
        // 找比目标值大的二分查找
        while(start < end) {
            int mid = (start + end) / 2;
            
            if(matrix[mid][0] == target)
                return true;
            
            if(matrix[mid][0] <= target)
                start = mid + 1;
            else
                end = mid;
        }
        
        int targetRow = end > 0 ? end - 1 : end;
        
        // 找相等数的二分查找，注意和上一个二分查找的区别
        start = 0, end = matrix[targetRow].size();
        while(start != end) { 
            int mid = (start + end) / 2;
            if(matrix[targetRow][mid] == target)
                return true;
            else if(matrix[targetRow][mid] < target)
                start = mid + 1;
            else
                end = mid;
        }
        
        return false;  
    }
};

参考：

https://www.cnblogs.com/grandyang/p/4323301.html