【矩阵】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) {
        int row = matrix.length;
        if(row == 0) return false;
        int col = matrix[0].length;
        if(col == 0) return false;
        if(target< matrix[0][0]) return false;  
        
        int up = 0, down = row-1;
        int pos = 0;
        while(up <= down){
            int mid = (up + down) /2;
            if(matrix[mid][0] == target){
                return true;
            }
            if(matrix[mid][0] > target){
                down = mid-1;
            }
            else up = mid + 1;
        }
        
        pos = down;
        
        int left = 0, right = col-1;
        while(left <= right){
            int mid = (left + right) / 2;
            if(matrix[pos][mid] == target) return true;
            if(matrix[pos][mid] > target) right = mid-1;
            else left = mid + 1;
        }
        return false;
    }
}

解法二：将二维矩阵当初一维矩阵处理

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