Search a 2D Matrix (Java)

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.

注意当走到某一行内后，如果没找到要break跳出循环，否则可能出现死循环。

Source

public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
    	int low = 0, high = matrix.length - 1;
    	
    	while(low <= high){
    		int mid = low + ((high - low) >> 1);
    		if(matrix[mid][0] > target){
    			high = mid - 1;
    		}
    		else if(matrix[mid][matrix[0].length - 1] < target){
    			low = mid + 1;
    		}
    		else{
    			int lown = 0, highn = matrix[0].length - 1;
    			while(lown <= highn){
    				int midn = lown +((highn - lown) >> 1);
    				if(matrix[mid][midn] > target){
    					highn = midn - 1;
    				}
    				else if(matrix[mid][midn] < target){
    					lown = midn + 1;
    				}
    				else return true;
    			}
    			break;   //***
    		}
    	}
    	return false;
    }
}

Test

    public static void main(String[] args){
    	int[][] matrix = {{1, 3, 5, 7},{10, 11, 16, 20},{23, 30, 34, 50}};
     	System.out.println(new Solution().searchMatrix(matrix, 4));
    
    }