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.

copyright:Leetcode

public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
		if(target < matrix[0][0] || target > matrix[matrix.length - 1][matrix[matrix.length - 1].length - 1]){
			return false;
		}
		int low = 0, high = matrix.length - 1, mid = (low + high) / 2;
		int tarRow = 0;
		for(;low <= high;mid = (low + high) / 2){
//			System.out.println("h"+high+" mid:" + mid+" low"+low);//
			if(target == matrix[mid][0]){
				return true;
			
			}else if(target > matrix[mid][0]){
				if(low == high){//now low == high == mid
					tarRow = mid;
					break;
				}else{
					low = mid + 1;
					
				}
			}else{
				if(low == high || mid == low){//mid == low means h == 2 mid == low ==1 and target < matrix[mid],then h = 0,but low = 0; tarRow = 0
					tarRow = mid - 1;
					break;
				}
				else{
					high = mid - 1;
				}
			}
		}
//		System.out.println("tarRow:" + tarRow);//
		low = 0; high = matrix[tarRow].length - 1; mid = (low + high) / 2;
		for(;low <= high;mid = (low + high) / 2){
			if(target == matrix[tarRow][mid])
				return true;
			else if(target > matrix[tarRow][mid]){
				low = mid + 1;
			}else{
				high = mid - 1;
			}
		}
		return false;
    }
}

2次应用折半查找法

Runtime: 380 ms