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

从右上角开始找

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

        return false;
    }
}