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.

解法：由于矩阵每一行的末尾数字都小于下一行的开头数字，并且每行都有序，因此我们可以把矩阵当做一个一维数组，长度为row*column,在有序的一位数组中，采用Binary Search来查找target.

public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        if(matrix == null || matrix.length == 0) {
            return false;
        }
        int row = matrix.length;
        int col = matrix[0].length;
        int left = 0;
        int right = row*col - 1;
        while(left <= right) {
            int mid = left + (right - left)/2;
            if(matrix[mid/col][mid%col] == target) {
                return true;
            }
            else if(matrix[mid/col][mid%col] > target) {
                right = mid - 1;
            }
            else {
                left = mid + 1;
            }
        }
        return false;
    }
}

注意：对于一个row*column的矩阵，某元素matrix[x][y]转化成一维数组a中对应元素为a[x*row+y]；相反的，将一维数组某元素a[x]转化为矩阵即为matrix[x/column][x%column].