FoodFill算法:在一个4*5的只存在‘1’和‘0’方形表格中,求‘1’的连通块的数量
例如(四连通):
11000
11000
00100
00011
(四连通:只搜索上下左右四个方向)答案是3
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define x first
#define y second
typedef pair<int, int > PII;
const int N = 300, M = N * N;
PII q[M];
bool st[N][N] = { false };
char g[N][N];
void bfs(int sx, int sy, int n, int m)
{
int hh = 0; int tt = 0; int j, k;
q[0] = { sx,sy };
st[sx][sy] = true;
int lx[4] = { -1,0,1,0 };
int ly[4] = { 0,-1,0,1 };
while (hh <= tt)
{
PII t = q[hh++];
for (int i = 0; i < 4; i++)
{
j = t.x + lx[i];
k = t.y + ly[i];
if (j < 0 || j >= n || k < 0 || k >= m)continue;
if (g[j][k] == '0' || st[j][k])continue;
q[++tt] = { j,k };
st[j][k] = true;
}
}
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) scanf("%s", g[i]);
int cnt = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (g[i][j] == '1' && st[i][j] == false)
{
bfs(i, j, n, m);
cnt++;
}
}
}
printf("%d", cnt);
}
例如(八连通):
WW...
WW...
..W..
...WW
(八连通:搜索上下左右以及右上左上右下左下八个方向):答案是1
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define x first
#define y second
typedef pair<int, int > PII;
const int N = 1010,M = N * N;
int n, m;
char g[N][N];
PII q[M];
bool st[N][N];
void bfs(int sx, int sy)
{
int hh = 0; int tt = 0;
q[0] = { sx,sy };
st[sx][sy] = true;
while (hh <= tt)
{
PII t = q[hh++];
for(int i = t.x - 1;i <= t.x + 1;i++)
for (int j = t.y - 1; j <= t.y + 1; j++)
{
if (i == t.x && j == t.y)continue;
if (i < 0 || i >= n || j < 0 || j >= m)continue;
if (g[i][j] == '.' || st[i][j])continue;
q[++tt] = { i,j };
st[i][j] = true;
}
}
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) scanf("%s", g[i]);
int cnt = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (g[i][j] == 'W' && st[i][j] == false)
{
bfs(i, j);
cnt++;
}
}
}
printf("%d\n", cnt);
return 0;
}
FoodFill算法里面有深度优先搜索的思想,也就是先遍历一个符合要求的格子的周围,再遍历周围格子的周围。