蓝桥打卡-day23 长草-暴力

解题思路与灌溉一模一样 == 我用暴力跑的蓝桥打卡-day19_凌墨£的博客-CSDN博客

import java.util.Scanner;
// 1:无需package
// 2: 类名必须Main, 不可修改

public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        //在此输入您的代码...
        int n = scan.nextInt();
        int m = scan.nextInt();
        char[][] a = new char[n][m];
        int[][] b = new int[n][m];
        for(int i = 0 ; i < n ; i++) a[i] = scan.next().toCharArray();
        int k1 = scan.nextInt();
        
        int JiLu = 0;
        for(int i = 0 ; i < k1 ; i++){
          JiLu++;
          for(int j = 0 ; j < n ; j++){
            for(int k = 0 ; k < m ; k++){
              if(a[j][k] == 'g' && b[j][k] == JiLu-1){
                if(j+1 < n && b[j+1][k] == 0){
                  a[j+1][k] = 'g';
                  b[j+1][k] = JiLu;
                } 
                if(k+1 < m && b[j][k+1] == 0){
                  a[j][k+1] = 'g';
                  b[j][k+1] = JiLu;
                } 
                if(j-1 >= 0 &&  b[j-1][k] == 0){
                  a[j-1][k] = 'g';
                  b[j-1][k] = JiLu;
                } 
                if(k-1 >= 0 && b[j][k-1] == 0){
                  a[j][k-1] = 'g';
                  b[j][k-1] = JiLu;
                } 
              }             
            }
          }
        }
        for(int i = 0 ; i < n ; i++){
          for(int j = 0 ; j < m ; j++){
           System.out.print(a[i][j]);
          }
          System.out.println();
        }
        scan.close();
    }
}