复习-JZ1 二维数组中的查找

17:28-17.32

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


    }
}