算法笔记 - Chapter8矩阵块个数

基础BFS

• 自作答案

//2020/4/8
#include<stdio.h>
#include<queue>
#include<string.h>
using namespace std;

struct Node
{
    int x,y;
    Node(int x_,int y_):x(x_),y(y_){}
};

const int maxn = 100;

int R,C;
int ans = 0;

int X[4] = {1,-1,0,0};
int Y[4] = {0,0,1,-1};

int visited[maxn][maxn];
int matric[maxn][maxn];


int test(int x,int y)
{
    if(x<0 || x>=R || y<0 || y>=C)
        return 0;

    if(matric[x][y] == 0)
        return 0;

    if(visited[x][y] == 1)
        return 0;

    return 1;
}

void BFS(int x,int y)
{
    queue<Node> q;
    q.push(Node(x,y));
    visited[x][y] = 1;

    while( !q.empty() )
    {
        Node temp = q.front();
        q.pop();

        for(int i = 0;i<4;i++)
        {
            int newX = temp.x + X[i];
            int newY = temp.y + Y[i];

            if(test(newX,newY))
            {
                q.push(Node(newX,newY));
                visited[newX][newY] = 1;
            }
        }
    }
}

void TravalBFS()
{
    for(int i = 0;i<R;i++)
    {
        for(int j = 0;j<C;j++)
        {
            if(!visited[i][j] && matric[i][j] == 1)
            {
                BFS(i,j);
                ans++;
            }
        }
    }
}
int main()
{
    scanf("%d%d",&R,&C);
    for(int i = 0;i<R;i++)
    {
        for(int j = 0;j<C;j++)
        {
            scanf("%d",&matric[i][j]);
        }
    }

    memset(visited,0,sizeof(visited));

    TravalBFS();
    printf("%d\n",ans);
    return 0;
}