#include<stdio.h>
void initBoard(char arr[102][102], int N, int M)
{
for (int i = 0; i < 102; i++)
{
for (int j = 0; j < 102; j++)
{
arr[i][j] = '^';
}
}
for (int i = 1; i <= N; i++)
{
for (int j = 1; j <= M; j++)
{
scanf_s("%c", &arr[i][j]);
}
getchar();
}
}
int judge(char mine[102][102], int x, int y)
{
if (mine[x][y] = '*')
return 1;
else
return 0;
}
int minecount(char mine[102][102], int x, int y)
{
int sum = 0;
if (judge(mine,x - 1, y))
sum++;
if (judge(mine, x + 1, y))
sum++;
if (judge(mine, x - 1, y - 1))
sum++;
if (judge(mine, x + 1, y + 1))
sum++;
if (judge(mine, x - 1, y + 1))
sum++;
if (judge(mine, x + 1, y - 1))
sum++;
if (judge(mine, x, y - 1))
sum++;
if (judge(mine, x, y + 1))
sum++;
return sum;
}
void findMine(char arr[102][102], int N, int M)
{
for (int i = 1; i <= N; i++)
{
for (int j = 1; j <= M; j++)
{
if (arr[i][j] == '*')
{
printf("%c", arr[i][j]);
}
else
{
printf("%d", minecount(arr, i, j));
}
}
printf("\n");
}
}
int main()
{
int count = 1;
int N = 0;
int M = 0;
char arr[102][102] = { 0 };
while (scanf("%d %d\n", &N, &M) != EOF)
{
// getchar();
if (M == N && N == 0)
{
return 0;
}
initBoard(arr, N, M);
printf("Field #%d:\n", count);
findMine(arr, N, M);
printf("\n");
count++;
}
return 0;
}
扫雷数都是8,怎么解决?应该是27行的函数有问题,如何修改?