1 Star 0 Fork 0

Roderland/algorithm

Create your Gitee Account
Explore and code with more than 14 million developers,Free private repositories !:)
Sign up
文件
This repository doesn't specify license. Please pay attention to the specific project description and its upstream code dependency when using it.
Clone or Download
Question529.java 2.74 KB
Copy Edit Raw Blame History
Roderland authored 2020-10-23 18:19 +08:00 . add
package question;
/*
@author: Roderland
@create: 2020-09-15---23:13
*/
public class Question529 {
public static void main(String[] args) {
char[][] board = {{'E', 'E', 'E', 'E', 'E'},
{'E', 'E', 'M', 'E', 'E'},
{'E', 'E', 'E', 'E', 'E'},
{'E', 'E', 'E', 'E', 'E'}};
int[] click={3,0};
System.out.println(new Question529().updateBoard(board, click));
}
char[][] board;
public char[][] updateBoard(char[][] board, int[] click) {
this.board=board;
if (this.board[click[0]][click[1]]=='M') {
this.board[click[0]][click[1]]='X';
return this.board;
}
this.board[click[0]][click[1]]=getFlag(click[0], click[1]);
if (this.board[click[0]][click[1]]=='B') fun(click[0], click[1]);
return this.board;
}
public void fun(int i, int j) {
if (j+1<board[i].length&&board[i][j+1]=='E') {
board[i][j+1]=getFlag( i, j+1);
if (board[i][j+1]=='B') fun(i, j+1);
}
if (j+1<board[i].length&&i+1<board.length&&board[i+1][j+1]=='E') {
board[i+1][j+1]=getFlag(i+1, j+1);
if (board[i+1][j+1]=='B') fun(i+1, j+1);
}
if (i+1<board.length&&board[i+1][j]=='E') {
board[i+1][j]=getFlag(i+1, j);
if (board[i+1][j]=='B') fun(i+1, j);
}
if (i+1<board.length&&j-1>=0&&board[i+1][j-1]=='E') {
board[i+1][j-1]=getFlag(i+1, j-1);
if (board[i+1][j-1]=='B') fun(i+1, j-1);
}
if (j-1>=0&&board[i][j-1]=='E') {
board[i][j-1]=getFlag(i, j-1);
if (board[i][j-1]=='B') fun( i, j-1);
}
if (j-1>=0&&i-1>=0&&board[i-1][j-1]=='E') {
board[i-1][j-1]=getFlag(i-1, j-1);
if (board[i-1][j-1]=='B') fun(i-1, j-1);
}
if (i-1>=0&&board[i-1][j]=='E') {
board[i-1][j]=getFlag(i-1, j);
if (board[i-1][j]=='B') fun( i-1, j);
}
if (i-1>=0&&j+1<board[i].length&&board[i-1][j+1]=='E') {
board[i-1][j+1]=getFlag(i-1, j+1);
if (board[i-1][j+1]=='B') fun( i-1, j+1);
}
}
private char getFlag(int i, int j) {
int count = 0;
if (i+1<board.length&&board[i+1][j]=='M') count++;
if (i+1<board.length&&j+1<board[i].length&&board[i+1][j+1]=='M') count++;
if (j+1<board[i].length&&board[i][j+1]=='M') count++;
if (i-1>=0&&board[i-1][j]=='M') count++;
if (j-1>=0&&board[i][j-1]=='M') count++;
if (i-1>=0&&j-1>=0&&board[i-1][j-1]=='M') count++;
if (i+1<board.length&&j-1>=0&&board[i+1][j-1]=='M') count++;
if (i-1>=0&&j+1<board[i].length&&board[i-1][j+1]=='M') count++;
if (count==0) return 'B';
return (char) (48+count);
}
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Java
1
https://gitee.com/Roderland/algorithm.git
git@gitee.com:Roderland/algorithm.git
Roderland
algorithm
algorithm
master

Search