240. Search a 2D Matrix II +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 in ascending from left to right.
• Integers in each column are sorted in ascending from top to bottom.

For example,

Consider the following matrix:

[
  [1,   4,  7, 11, 15],
  [2,   5,  8, 12, 19],
  [3,   6,  9, 16, 22],
  [10, 13, 14, 17, 24],
  [18, 21, 23, 26, 30]
]

Given target = 5, return true.

Given target = 20, return false.

先找到满足条件的行，再在每行里搜索。

II：

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

I：

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

直接从右上角开始搜索：

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