Minesweeper -题解（C++代码）

解题思路:

注意事项:

参考代码:

#include<iostream>

#include<vector>

#include<string>

using namespace std;

void Search(vector<vector<int> > &vec,vector<string>  str,int x,int y)                      //用于记录地雷附近的空格

{

     int line[8]={x-1,x-1,x-1,x,x+1,x+1,x+1,x};               //靠近地雷位置的纵坐标

     int col[8]={y-1,y,y+1,y+1,y+1,y,y-1,y-1};               //靠近地雷位置的横坐标

     for(int i=0;i<8;i++)

     {

             if(line[i]<0 || col[i]<0 || line[i]>=str.size() || col[i]>=str.size())                //判断位置是否合法

                    continue ;

             if(str[line[i]][col[i]]!='*')

                    vec[line[i]][col[i]]+=1;

     }

}

int main()

{

         int x=0,y=0;

         int num=1;

         cin>>x>>y;

         while(x*y)

         {

                 string c1;

                 vector<string>  str;                                 //用于存储字符串

                 vector<vector<int> > vec(x,vector<int>(y,0));                    

                 for(int i=0;i<x;i++)                                //输入字符串

                 {

                         cin>>c1;

                         str.push_back(c1);

                 }

                 for(int i=0;i<x;i++)                                //标记地雷

                 {

                         for(int j=0;j<y;j++)

                         {

                         if(str[i][j]=='*') Search(vec,str,i,j);

                         }

                 }

                 cout<<"Field #"<<num<<':'<<endl;

                 num++;

                 for(int i=0;i<x;i++)                                //显示矩阵

                 {

                         for(int j=0;j<y;j++)

                         {

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

                                        cout<<'*';

                                 else 

                                        cout<<vec[i][j];

                         }

                         cout<<endl;

                 }

                 cout<<endl;

                 cin>>x>>y;

         }

         return 0;

}