leetcode#74Search 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 from left to right.
The first integer of each row is greater than the last integer of the previous row.
Example 1:

Input:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 3
Output: true
Example 2:

Input:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 13
Output: false

思路
拿到题目后感觉不难
首先要确定所找的数在哪行，在寻找

具体思路设两个变量
i 代表行数从第一行到最后一行
j代表每行的第几个数

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