LeetCode74： 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

思路

数组元素从左到右，从上到下是有序的，利用二分法搜索

java实现

class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        if(matrix==null || matrix.length==0)
            return false;
        if(matrix[0]==null || matrix[0].length==0)
            return false;

        int rows=matrix.length;
        int cols=matrix[0].length;

        int start=0;
        int end=cols*rows-1;
        


        //可以发现matrix是有序的（递增）
        while (start+1<end){
            int midddle=start+(end-start)/2;
            int row=midddle/cols;
            int col=midddle%cols;
            if(matrix[row][col]<target){
                start=midddle;//目标比中间值大 将搜索范围缩小到后半部分
            }
            else if(matrix[row][col]>target){
                end=midddle;//目标比中间值小 将搜索范围缩小到前半部分
            }
            else
                return true;
        }
        if(matrix[start/cols][start%cols]==target)
            return true;
        if(matrix[end/cols][end%cols]==target)
            return true;
        return false;
    }
}