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

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

        return false;
    }
}