Leetcode74搜索二维矩阵

1111-3

代码：

两个二分查找

class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        int m = matrix.length;
        int n = matrix[0].length;
        int rl = 0,rr = m-1;
        int rm = (rl+rr)/2;
        while(rl<rr){
            rm = (rl+rr+1)/2;

            if(matrix[rm][0]==target){
                return true;
            }else if(matrix[rm][0]>target){
                rr = rm-1;
            }else{
                rl = rm;
            }
        }
        int cl = 0,cr = n-1;
        while(cl<=cr){
            int cm = (cl+cr)/2;
            if(matrix[rl][cm]==target){
                return true;
            }else if(matrix[rl][cm]>target){
                cr = cm-1;
            }else{
                cl = cm+1;
            }
        }
        return false;
    }
}