74. Search a 2D Matrix

weixin_34150830

于 2019-06-29 11:57:58 发布

阅读量269

点赞数 1

原文链接：http://www.cnblogs.com/asuran/p/7595978.html

版权

public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        if(matrix.length==0||matrix[0].length==0)
            return false;
        int m=matrix.length;
        int n=matrix[0].length;
        int lo=0;
        int hi=m*n-1;
        while(lo<hi)
        {
            int mi=(lo+hi)/2;
            if(target<=matrix[mi/n][mi%n])
                hi=mi;
            else
                lo=mi+1;
        }
        return matrix[lo/n][lo%n]==target;
    }
}