01.有序的二维数组中查找给定数值

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

从左下角开始，小于target右移，大于target上移动

[1, 2  , 3 ,  4 ]

[5, 9  , 13, 17]

[6, 10, 14, 18]

[7, 11, 15 ,19 ]