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

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

    }
    return false;

}

}