Minesweeper （C++代码）

解题思路:输入时给result赋初值为0,然后遍历map,遇见*时更新result

注意事项:

参考代码:

#include<iostream>

#include<cstdio>

using namespace std;

int main()

{

    char map[100][100];

    char result[100][100];

    int m,n;

    int i,j;

    int count = 0;

    while(scanf("%d %d",&m,&n) != EOF && m != 0 && n != 0)

    {

    count ++;

    // 写入map，给result赋值为0

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

    {

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

        {

            cin >> map[i][j];

            result[i][j] = '0'-0;

        }

    }

//扫雷

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

    {

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

        {

            if(map[i][j] == '*')

            {

                result[i][j] = map[i][j];

                for(int k = i - 1; k <= i + 1;k++)

                {

                    for(int t = j -1; t <= j + 1; t++)

                    {

                        if( k >= 0 && k < m &&  t >= 0 && t < n && !(k == i && t == j) && map[k][t] != '*')

                         {

                            result[k][t] = result[k][t]+1;

                          }

                    }

                }

            }

        }

    }

//打印输出

    cout << "Field #"<<count<<":"<<endl;

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

        {

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

            {

                cout << result[i][j];

            }

                cout << endl;

          }

            cout << endl;

    }

            return 0;

}