LeetCode 74 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) {
		if (matrix == null || matrix.length == 0)
			return false;

		int row = matrix.length;
		int column = matrix[0].length;

		int left = 0;
		int right = row * column-1;
		int mid;
		int temp;
		
		while (left <= right) {
			mid = (left + right) >> 1;
			temp = matrix[mid / column][mid % column];
			if (target == temp) return true;
			else if (target > temp) left = mid + 1;
			else right = mid - 1;
		}
		
		return false;
	}
}