题解 | #二维数组中的查找#

解题思路：参考CS-Notes

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

知识点： 1.计算二维数组array的维数m*n;

m = array.length;
n = array[].length;