leetcode 1034. 边界着色

为了12月打卡的小牌～～～

感谢大佬！！！（照着敲了一遍 学习了一下！！！）

class Solution {
    private int N;
    private int M;
    private boolean[][] isValid;
    public int[][] colorBorder(int[][] grid, int row, int col, int color) {
        N = grid.length;
        M = grid[0].length;
        isValid = new boolean[N][M];
        int init = grid[row][col];
        colorBorder(grid, row, col, init, color);
        return grid;
    }

    public void colorBorder(int[][] grid, int row, int col, int init, int color){
        if(row < 0 || row >= N || col < 0 || col >= M){
            return;
        } else {
            if(grid[row][col] == init && !isValid[row][col]){
                isValid[row][col] = true;
                int count = 0;
                
                if(row < N-1 && (isValid[row+1][col] || grid[row+1][col] == init)){
                    count++;
                }

                if(row > 0 && (isValid[row-1][col] || grid[row-1][col] == init)){
                    count++;
                }

                if(col < M-1 && (isValid[row][col+1] || grid[row][col+1] == init)){
                    count++;
                }

                if(col > 0 && (isValid[row][col-1] || grid[row][col-1] == init)){
                    count++;
                }

                if(count < 4){
                    grid[row][col] = color;
                }
                
                colorBorder(grid, row-1, col, init, color);
                colorBorder(grid, row+1, col, init, color);
                colorBorder(grid, row-1, col, init, color);
                colorBorder(grid, row, col+1, init, color);
                colorBorder(grid, row, col-1, init, color);
            }
        }
    }
}