这题的做法:
1. 把外面一圈的每一个o都traverse一下(bfs,dfs 都可以),把它们mark成第三种字母y
2. 把整个board跑一遍,看到o就变成x, 看到y就变成o
要注意的点:
1. 这里在做dfs/bfs的时候不需要用visited,只需要在if里查board[i][j]=='O'就行,因为visited已经被mark成y了。
2. bfs时保存坐标点用 i * board[0].length + j 是常用的方法。
//7:08
public class Solution {
public void solve(char[][] board) {
if (board==null||board.length==0||board[0].length==0) return;
boolean[][] used = new boolean[board.length][board[0].length];
for (int i=0;i<board.length;i++) {
if (board[i][0]=='O') flipMargins(board, used, i, 0);
if (board[i][board[0].length-1]=='O') flipMargins(board,used,i,board[0].length-1);
}
for (int j=1;j<board[0].length-1;j++) {
if (board[0][j]=='O') flipMargins(board, used, 0, j);
if (board[board.length-1][j]=='O') flipMargins(board,used,board.length-1, j);
}
for (int i=1;i<board.length-1;i++) {
for (int j=1;j<board[0].length-1;j++) {
if (board[i][j]=='O') board[i][j]='X';
}
}
for (int i=0;i<board.length;i++) {
for (int j=0;j<board[0].length;j++) {
if (board[i][j]=='Y') board[i][j]='O';
}
}
}
private void flipMargins(char[][] board, boolean[][] used, int i, int j) {
Queue<Integer> queue = new LinkedList<Integer>();
board[i][j]='Y';
queue.add(board[0].length * i + j);
while (!queue.isEmpty()) {
int hash = queue.remove();
i = hash/board[0].length;
j = hash%board[0].length;
fill(i, j+1, queue, board);
fill(i, j-1, queue, board);
fill(i+1, j, queue, board);
fill(i-1, j, queue, board);
}
}
private void fill(int i, int j, Queue<Integer> queue, char[][] board) {
if (i<0 || i>=board.length || j<0 || j>=board[0].length) return;
if (board[i][j]=='O') {
board[i][j]='Y';
queue.add(i*board[0].length+j);
}
}
}