[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.

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[][] matrix, int target) {
        int row = matrix.length;
        int col = matrix[0].length;
        int u = 0, d = row - 1, l = 0, r = col - 1;
        int m1 = 0, m2 = 0;

        while (u <= d) {
            m1 = (u + d)/2;
            if (matrix[m1][0] <= target && matrix[m1][col-1] >= target) break;
            if (matrix[m1][0] > target) d = m1 - 1;
            else if (matrix[m1][0] < target) u = m1 + 1;
        }

        if (u > d) return false;

        while ( l <= r) {
            m2 = (l + r)/2;
            if (matrix[m1][m2] == target) return true;
            if (matrix[m1][m2] > target) r = m2 - 1;
            else if (matrix[m1][m2] < target) l = m2 + 1;
        }

        return false;
    }
}