Search a 2D Matrix Java

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.

 Key to solve:
    Since Matrix is sorted by increasing order from top->bottom + left -> right
    1. We can search from right-top or left-bottom
Ex: start from right-top =>
to define row start from 0, and column start from length-1
if element equal to target return true, 
else if  it less than target increasing row,
else decreasing column 

public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
         if(matrix==null) return false;
        //check start from right-top
        int row=0;
        int col=matrix[0].length-1;
        while(row<matrix.length && col>=0){
            if(matrix[row][col]==target) return true;
            //increasing row++, if less than target
            else if(matrix[row][col]<target){
                row++;
            //decreasing col-- if greater than target
            }else {
                col--;
            }
        }
        return false;
    }
}