day25

1.import java.util.Scanner; // 1:无需package // 2: 类名必须Main, 不可修改 public class Main { static int N=1010; static int[][] vis=new int[N][N]; static int flag=0; static int[][] d= {{0,1}, {0,-1}, {1,0}, {-1,0}}; public static void main(String[] args) { Scanner scan=new Scanner(System.in); int n=scan.nextInt(); char[][] map=new char[n][n]; for(int i=0;i<n;i++) { map[i]=(scan.next()).toCharArray(); } int ans=0; for(int i=0;i<n;i++){ for(int j=0;j<n;j++) { if(vis[i][j]==0 && map[i][j]=='#') { flag=0; dfs(map,i,j); if(flag==0) { ans++; } } } } System.out.println(ans); } public static void dfs(char[][] map,int x,int y) { vis[x][y]=1; if(map[x][y+1]=='#' && map[x][y-1]=='#' && map[x+1][y]=='#' && map[x-1][y]=='#') { flag=1; } for(int i = 0; i < 4; i++){ int nx = x + d[i][0], ny = y + d[i][1]; if(vis[nx][ny]==0 && map[nx][ny]=='#') { dfs(map,nx,ny); } } } }