Java在多维递归中查找“污点”

Question

我正在尝试解决这个递归练习：

在多维板（M x N）中，每个元素都可以是空的，也可以是满的。

“污点”大小是相邻且值为“x”的元素的数量。

  | 0 | 1 | 2 | 3 | 4 |
0 |   | x |   |   | x |
1 | x |   |   | x | x |
2 |   |   | x | x |   |
3 | x |   |   |   |   |
4 | x | x | x |   |   |

null

public static int stain (char [][] mat, int row, int col)

Answer 1

    public static int size(boolean[][] a, int i, int j) {
    boolean[][] temp = new boolean[a.length][a[0].length];
    if (exists(a, i, j) && isStained(a, i, j)) {
        temp[i][j] = true;
        if (i == a.length - 1) {
            return size(a, i, j, temp, 1, 0, false, true);
        }
        return size(a, i, j, temp, 1, 0, false, false);
    }
    return 0;
}

private static boolean exists(boolean[][] a, int i, int j) {
    if ((i < 0) || (i >= a.length) || (j < 0) || (j >= a[0].length)) {
        return false;
    }
    return true;
}

private static boolean isStained(boolean[][] a, int i, int j) {
    if (a[i][j] == false) {
        return false;
    }
    return true;
}

private static int size(boolean[][] a, int i, int j, boolean[][] temp, int count, int iLenght, boolean progress,
        boolean dir) {
    if (exists(a, i - 1, j - 1)) {
        if (isStained(a, i - 1, j - 1)) {
            if (temp[i - 1][j - 1] == false) {
                progress = true;
                temp[i - 1][j - 1] = true;
                return size(a, i - 1, j - 1, temp, ++count, iLenght, progress, dir);
            }
        }
    }
    if (exists(a, i - 1, j)) {
        if (isStained(a, i - 1, j)) {
            if (temp[i - 1][j] == false) {
                progress = true;
                temp[i - 1][j] = true;
                return size(a, i - 1, j, temp, ++count, iLenght, progress, dir);
            }
        }
    }
    if (exists(a, i - 1, j + 1)) {
        if (isStained(a, i - 1, j + 1)) {
            if (temp[i - 1][j + 1] == false) {
                progress = true;
                temp[i - 1][j + 1] = true;
                return size(a, i - 1, j + 1, temp, ++count, iLenght, progress, dir);
            }
        }
    }
    if (exists(a, i, j - 1)) {
        if (isStained(a, i, j - 1)) {
            if (temp[i][j - 1] == false) {
                progress = true;
                temp[i][j - 1] = true;
                return size(a, i, j - 1, temp, ++count, iLenght, progress, dir);
            }
        }
    }
    if (exists(a, i, j + 1)) {
        if (isStained(a, i, j + 1)) {
            if (temp[i][j + 1] == false) {
                progress = true;
                temp[i][j + 1] = true;
                return size(a, i, j + 1, temp, ++count, iLenght, progress, dir);
            }
        }
    }
    if (exists(a, i + 1, j - 1)) {
        if (isStained(a, i + 1, j - 1)) {
            if (temp[i + 1][j - 1] == false) {
                progress = true;
                temp[i + 1][j - 1] = true;
                return size(a, i + 1, j - 1, temp, ++count, iLenght, progress, dir);
            }
        }
    }
    if (exists(a, i + 1, j)) {
        if (isStained(a, i + 1, j)) {
            if (temp[i + 1][j] == false) {
                progress = true;
                temp[i + 1][j] = true;
                return size(a, i + 1, j, temp, ++count, iLenght, progress, dir);
            }
        }
    }
    if (exists(a, i + 1, j + 1)) {
        if (isStained(a, i + 1, j + 1)) {
            if (temp[i + 1][j + 1] == false) {
                progress = true;
                temp[i + 1][j + 1] = true;
                return size(a, i + 1, j + 1, temp, ++count, iLenght, progress, dir);
            }
        }
    }
    if (iLenght >= a.length || progress == false) {
        return count;
    } else {
        ++iLenght;
        if (dir == true) {
            i = i + iLenght;
        } else {
            i = iLenght;
        }
        progress = false;
        return size(a, i, j, temp, count, iLenght, progress, dir);
    }
}