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.

从给定的二维矩阵中找到指定的数。
思路：
从右上角开始找，如果当前数字比target大，左移一列（列数减1）；如果当前数字比target小，下移一行（行数加1），当前数字等于target即返回true。

class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        if(matrix == null || matrix.length == 0|| matrix[0].length == 0  ||matrix[0] == null) return false;

        int cols=matrix[0].length-1, rows=matrix.length-1;//m --cols  n-- rows
        int col = cols, row = 0;
        while(row <=rows && col >=0){
            if(matrix[row][col] == target) {
                return true;
            }
            else if (matrix[row][col] > target ){
                col--;
            }
            else{
                row++;
            }
        }
        return false;
    }
}