.对于每一个边界上的 O,我们以它为起点,标记所有与它直接或间接相连的字母 O;
.最后我们遍历这个矩阵,对于每一个字母:.如果该字母被标记过,则该字母为没有被字母 X 包围的字母 O,我们将其还原为字母 O;
.如果该字母没有被标记过,则该字母为被字母 X 包围的字母 O,我们将其修改为字母 X。
#include<iostream>
#include<vector>
#include<cstdlib>
#include<time.h>
using namespace std;
class Solution {
public:
void dfs(vector<vector<char>>& board, int i, int j){
if (i<0 || i>=board.size() || j<0 || j>=board[0].size() || board[i][j]!='O'){
return ;
}
board[i][j]='A';
dfs(board, i + 1, j);
dfs(board, i - 1, j);
dfs(board, i, j + 1);
dfs(board, i, j - 1);
}
void solve(vector<vector<char>>& board) {
int n=board.size();
if (n==0){
return ;
}
int m=board[0].size();
for(int i=0; i<n;i++){
dfs(board, i,0);
dfs(board, i, m-1);
}
for (int j=1; j<m-1; j++){
dfs(board, 0, j);
dfs(board, n-1, j);
}
for (int i=0; i<n;i++){
for(int j=0; j<m;j++){
if (board[i][j] == 'A'){
board[i][j] = 'O';
}
else if (board[i][j] == 'O') {
board[i][j] = 'X';
}
}
}
}
};
int main(){
int m=4,n=4;
vector<vector<char>> board(m, vector<char>(n));
for (int i=0; i<m;i++){
for (int j=0; j<n; j++){
float s= 0+1.0*(rand()%RAND_MAX)/RAND_MAX *(1-0);
if (s>0.35){
board[i][j]='X';
cout<<board[i][j];
}
else{
board[i][j]='O';
cout<<board[i][j];
}
}
cout<<endl;
}
cout<<"Answer:"<<endl;
Solution S;
S.solve(board);
for(int i=0; i<m; i++){
for (int j=0;j<n;j++){
cout<<board[i][j];
}
cout<<endl;
}
return 0;
}
运行结果:
OXOX
XXXX
XXOX
XXXO
Answer:
OXOX
XXXX
XXXX
XXXO