leetcode-130. 被围绕的区域
题目:
代码:
#include <iostream>
#include <vector>
using namespace std;
int m,n;
void dfs(vector<vector<char> >& board,int x,int y){
if(x<0 || x>=m || y<0 || y>=n || board[x][y]!='O'){
return;
}
board[x][y]='A';
dfs(board,x+1,y);
dfs(board,x-1,y);
dfs(board,x,y+1);
dfs(board,x,y-1);
}
void solve(vector<vector<char> >& board) {
m=board.size();
n=board[0].size();
if(m==0){
return;
}
for(int i=0;i<m;i++){
dfs(board,i,0);
dfs(board,i,n-1);
}
for(int i=1;i<n-1;i++){
dfs(board,0,i);
dfs(board,m-1,i);
}
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(board[i][j]=='A'){
board[i][j]='O';
}else if(board[i][j]=='O'){
board[i][j]='X';
}
}
}
}
int main(){
int m,n;
cin>>m>>n;
vector<vector<char> > board(m,vector<char>(n));
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
cin>>board[i][j];
}
}
solve(board);
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
cout<<board[i][j]<<" ";
}
cout<<endl;
}
return 0;
}