二维数组中的查找

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

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