Minesweeper(c 语言）简单明了

解题思路:

注意事项:

参考代码:

#include<stdio.h>

char sweep(char a[][100],int n,int m)

{

    int i,j,k=0;

    char count[10]={'0','1','2','3','4','5','6','7','8','9'};

    for(i=0;i<n;i++)

    {

        for(j=0;j<m;j++,k=0)

        {

            if(a[i][j]!='*')

            {

                if(a[i][j+1]=='*')k++;

                if(a[i][j-1]=='*')k++;

                if(a[i+1][j]=='*')k++;

                if(a[i-1][j]=='*')k++;

                if(a[i-1][j+1]=='*')k++;

                if(a[i-1][j-1]=='*')k++;

                if(a[i+1][j+1]=='*')k++;

                if(a[i+1][j-1]=='*')

                    k++;

                a[i][j]=count[k];

            }

        }

    }

}

int main()

{

    int n=-1,m=-1,i,j,k=1,t;

    char a[100][100];

    while(1)

    {

        scanf("%d %d",&n,&m);

        if(n==0 && m==0)

            return 0;

        getchar();

        for(i=0;i<n;i++)

        {

            for(j=0;j<m;j++)

                scanf("%c",&a[i][j]);

            getchar();

        }

    sweep(a,n,m);

    printf("Field #%d:\n",k++);

    for(i=0;i<n;i++)

    {

        for(j=0;j<m;j++)

        printf("%c",a[i][j]);

        printf("\n");

    }

    printf("\n");

    }

return 0;

}