本题目做一个N x M的扫雷游戏，每个方格包含两种状态：关闭（closed）和打开（opened），初始化时每个方格都是关闭的，一个打开的方格也会包含两种状态：一个数字（clue）和一个雷（bomb）。你可以打开（open）一个方格，如果你打开的是 一个bomb，那么就失败；否则就会打开一个数字，该数字是位于[0，8]的一个整数，该数字表示其所有邻居方格（neighboring squares）所包含的雷数，应用该信息可以帮助你扫雷。-This subject, to do an N x M minesweeper game, each box contains two states: shut down (closed) and open (opened), initialization, each box is closed, the box will be an opencontains two states: a digital (clue) and a mine (bomb). You can open (open) a box, if you open a bomb, then fail　otherwise it will open a number, this number is located in [0,8] is an integer, the number represents all of its neighbors grid mine the number of neighboring squares contained in the application of this information can help you mine clearance.