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.
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]
]
代码
这一题的关键是从何处开始搜索。从右上角开始搜索有一个好处，如果是小于15，那么target肯定在除掉15所在列的矩阵（15所在列都是大于等于15的），如果大于15，那么target肯定在除掉15所在行的矩阵（15所在行都是小于等于15的）。

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