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.

题意：给一个矩阵，它的每一行是从左到右有序的，每一行的第一个数必定比上一行的最后一个数字大，找给定的target，返回true或

false。

代码和思路：

class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        
        int row = matrix.length;
        //如果为空，返回false
        if(row==0) return false;
        int column = matrix[0].length;
        
        int start = 0 , end = row*column-1;
        
        //因为完全有序，用简单的二分法查找即可
        while(start<=end){
            int mid = (start+end)/2;
            int mid_value = matrix[mid/column][mid%column];
            
            if(mid_value==target) return true;
            
            else if(mid_value > target){
                end = mid - 1;
            }
            else{
                start = mid + 1;
            }
        }
        return false;    
    }
}

第二种解法：

从右上角开始找，左边都小于它，下方都大于它

class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        int m = matrix.length-1;
        int i = 0;
        while(m>=0 && i<=matrix[0].length-1){
            if(matrix[m][i] == target) return true;
            else if(matrix[m][i]<target) i++;
            else m--;
        }
        return false;
    }
}