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.

思路： 先用每行的首字母来比较， 找到哪行， 再在当前行用二分查找

思路2 ： 把二维数组转化成一维数组来用二分查找。

易错点： 不论什么情况， 只要牵涉到 数组index , 一定要先判断是否越界或者不存在的情况。 还有就是判断target  比第一个 数字还小的情况。

public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        int m = matrix.length;
        if(m < 1)//--
            return false;
        int n = matrix[0].length;
        int row = 0;
        while(row < m && matrix[row][0] <= target){// --
            row++;
        }
        row--;
        if(row < 0)//--
            return false;
        return BS(matrix, row, target);
    }
    
    private boolean BS(int[][] matrix, int row, int target){
        int n = matrix[0].length;
        int left = 0, right = n - 1;
        while(left <= right){
            int mid = (left + right)/2;
            if(matrix[row][mid] == target)
                return true;
            else if(matrix[row][mid] < target)
                left = mid + 1;
            else
                right = mid - 1;
        }
        return false;
    }

<span style="font-family: Arial, Helvetica, sans-serif;">}</span><pre name="code" class="java">public class Solution {
        public boolean searchMatrix(int[][] matrix, int target) {
		int length = matrix.length;
		if (length == 0)
			return false;
		int width = matrix[0].length;
		int low = 0;
		int high = width * length - 1;
		while (low <= high) {
			int mid = (low + high) / 2;
			int x = mid / width;
			int y = mid % width;
			if (matrix[x][y] == target)
				return true;
			else if (matrix[x][y] > target) {
				high = mid - 1;
			} else {
				low = mid + 1;
			}
		}
		return false;
	}
}