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.

For example,

Consider the following matrix:

[
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]

Given target = 3, return true.

public class Solution {
    public boolean searchMatrix(int[][] m, int target) {
        int a=0;int b=m.length-1;
        while(a<=b){
            int mid=(a+b)/2;
            if(m[mid][0]==target)break;
            if(m[mid][0]<target){
                a=mid+1;
            }else{
                b=mid-1;
            }
        }
        
        int row=(a+b)/2; //可以看出当不等的时候mid指向的是小于target的那个值
        int c=0;int d=m[0].length-1;
        while(c<=d){
            int mid=(c+d)/2;
            if(m[row][mid]==target)return true;
            if(m[row][mid]<target){
                c=mid+1;
            }else{
                d=mid-1;
            }
        }
        return false;
    }
}