题目举例:给出一个m*n的矩阵,矩阵中的元素为0或1。称位置(x,y)与其上下左右四个位置是相邻的,如果矩阵中有若干个1是相邻的,那么称这些1构成了一个“块”(相邻互通的为1块)。求给定矩阵中“块”的个数。例如
该矩阵的有3个“块”。
C++代码实例:
#include <iostream>
#include <queue>
using namespace std;
const int maxn = 100;
int matrix[maxn][maxn];
int offset_x[4]={-1,0,1,0};
int offset_y[4]={0,1,0,-1};
bool ifpush[maxn][maxn] = {0};
int m, n;
struct pos{
int x, y;
};
bool judge(int x, int y)
{
if(ifpush[x][y]==1||matrix[x][y]==0)
return false;
if(x<0||x>=m||y<0||y>=n)
return false;
else
return true;
}
void BFS(int x, int y)
{
queue<struct pos> q;
struct pos pot;
pot.x = x;
pot.y = y;
q.push(pot);
ifpush[x][y] = 1;
while(!q.empty())
{
pot = q.front();
q.pop();
for(int i=0; i<4; i++)
{
int new_x = pot.x + offset_x[i];
int new_y = pot.y + offset_y[i];
if(judge(new_x, new_y))
{
struct pos now = q.front();
now.x = new_x;
now.y = new_y;
q.push(now);
ifpush[new_x][new_y] = 1;
}
}
}
}
int main(void)
{
int cnt = 0;
cin>>m>>n;
for(int i=0; i<m; i++)
{
for(int j=0; j<n; j++)
cin>>matrix[i][j];
}
for(int i=0; i<m; i++)
{
for(int j=0; j<n; j++)
{
if(judge(i, j))
{
BFS(i,j);
cnt++;
}
}
}
cout<<cnt;
return 0;
}
至于解析,等考研结束再说吧~~~