求空地的个数

最新推荐文章于 2023-03-24 16:27:16 发布

EmslieWu

最新推荐文章于 2023-03-24 16:27:16 发布

阅读量169

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/emslie/article/details/54584650

版权

算法专栏收录该内容

35 篇文章 0 订阅

订阅专栏

package work;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class AvacantRoom {
static char map[][];
     static int data[][];
     static int N,M;
     static int resum;
     static int []Dx={-1,-1,0,1,1,1,0,-1};
     static int []Dy={0,1,1,1,0,-1,-1,-1};
     static class Node{
    int x;
    int y;
     }
     static Node queue[];
public static void main(String[] args) throws FileNotFoundException {
/* Scanner sc=new Scanner(System.in);*/
  Scanner sc=new Scanner(new File("src/vacantRoom"));
  while(true){
   N=sc.nextInt();
   M=sc.nextInt();
   map=new char[N][M];
   data=new int[N][M];

   if(N==0||M==0){break;}
   resum=0;
   sc.nextLine();
   for (int i = 0; i < N; i++) {
    char[] line=sc.nextLine().toCharArray();
    for (int j = 0; j < line.length; j++) {
     map[i][j]=line[j];
     if(map[i][j]=='+'){data[i][j]=1;}
     else{data[i][j]=0;}
    }
   }
   for (int i = 0; i < N; i++) {
    for (int j = 0; j < M; j++) {
     if(data[i][j]==0){
      bfs(i,j);
     }
    }
   }
  System.out.println(resum);
   /*for (int i = 0; i < N; i++) {
    for (int j = 0; j <M; j++) {
     System.out.print(data[i][j]);
    }
    System.out.println();
   }*/
  }
}
private static void bfs(int x, int y) {
  queue=new Node[N*M];
  resum+=1;
  int head=0;
  int tail=0;
  data[x][y]=2;
  Node n1=new Node();
  n1.x=x;
  n1.y=y;
  queue[tail++]=n1;
  while(head<tail){
   for (int i = 0; i < 8; i++) {
    int dx=queue[head].x+Dx[i];
    int dy=queue[head].y+Dy[i];
    if(dx>=0&&dx<N&&dy>=0&&dy<M&&data[dx][dy]==0){
     data[dx][dy]=2;
     Node n2=new Node();
     n2.x=dx;
     n2.y=dy;
     queue[tail++]=n2;
    }
   }
   head++;
  }

}