Leetcode 240 Search a 2D Matrix II

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.

一开始的思路有点走偏，其实因为行和列都是有序的，从右上角开始排查就行了。

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