[jzof] 04 search in two-dimensional array

describe
In a two-dimensional array array in （ Each one-dimensional array has the same length ）, Each row is sorted in ascending order from left to right , Each column is sorted in ascending order from top to bottom . Please complete a function , Enter such a two-dimensional array and an integer , Determine whether the array contains the integer .
[
[1,2,8,9],
[2,4,9,12],
[4,7,10,13],
[6,8,11,15]
]
Given target = 7, return true.
Given target = 3, return false.

Ideas ： Start from the lower left corner and traverse , If the number of targets is greater than the value of the current position , Then start to the right , Otherwise, go up .

Empathy , You can also traverse from the upper right corner .

public class Solution {
    
    public boolean Find(int target,int [][] array) {
    
        int row=0;
        int col=array[0].length-1;
        while(row<=array.length-1&&col>=0){
    
            if(target==array[row][col])
                return true;
            else if(target>array[row][col])
                row++;
            else
                col--;
        }
        return false;
 
    }
}