二维数组的查找

线性查找，时间O(n)

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