130vejorigjeiorj

2021-09-22 10:33:13 阅读：79 来源： 互联网

标签：liantong 130vejorigjeiorj int back push array line

#include<iostream>
#include<vector>
#include<queue>
using namespace std;
//void isO(int x, int y, vector<vector<char> >a, vector<vector<bool> >&liantong,int line, int array)
//{
//	if(x<0 || y<0 || x>line-1 || y>array-1)
//		return;
//    if('O' == a[x][y] && false == liantong[x][y])
//    {
//        liantong[x][y] = true;
//        isO(x-1,y,a,liantong,line,array);
//        isO(x+1,y,a,liantong,line,array);
//        isO(x,y-1,a,liantong,line,array);
//        isO(x,y+1,a,liantong,line,array);
//    }
//    return;
//}
struct pos
{
public:
	int x;
	int y;
	pos(int _x, int _y):x(_x),y(_y){}
};
void isO(int x, int y, vector<vector<char> >a, vector<vector<bool> >&liantong,int line, int array)
{
	queue<pos>bfs;
	if('O'==a[x][y])
		bfs.push(pos(x,y));
	while(!bfs.empty())
	{
		if(x-1>=0 && 'O'==a[x-1][y] && !liantong[x-1][y])
			bfs.push(pos(x-1, y));
		if(x+1<=line-1 && 'O'==a[x+1][y] && !liantong[x+1][y])
			bfs.push(pos(x+1, y));
		if(y-1>=0 && 'O'==a[x][y-1] && !liantong[x][y-1])
			bfs.push(pos(x, y-1));
		if(y+1<=array-1 && 'O'==a[x][y+1] && !liantong[x][y+1])
			bfs.push(pos(x, y+1));

		if('O' == a[x][y])
			liantong[x][y] = true;

		bfs.pop();
		x=bfs.front().x;
		y=bfs.front().y;
	}
	return;
}
void solve(vector<vector<char>>& a) {
	int line = (int)a.size();	///<行
	int array = (int)a[0].size();///<列
	vector<vector<bool> >liantong(line, vector<bool>(array, false));
	for(int i=0; i<line-1; ++i)
	{
        isO(i, 0, a, liantong, line, array);///<第1列
        isO(i, array-1, a, liantong, line, array);///<最后一列
    }
    for(int j=0; j<array-1; ++j)
    {
        isO(0, j, a, liantong, line, array);///<第一行
        isO(line-1, j, a, liantong, line, array);///<最后一行
    }
	for(int i=1; i<line-1; ++i)
		for(int j=1; j<array-1; ++j)
			if(!liantong[i][j])
				a[i][j] = 'X';
	return;
}
int main(void)
{
	vector<vector<char> >a;
//	a.push_back({'X','X','X','X'});
//	a.push_back({'X','O','O','X'});
//	a.push_back({'X','X','O','X'});
//	a.push_back({'X','O','X','X'});

//	a.push_back({'O', 'O'});
//	a.push_back({'O', 'O'});

//	a.push_back({'X','O','X'});
//	a.push_back({'X','O','X'});
//	a.push_back({'X','O','X'});

//	a.push_back({'O','X','O'});
//	a.push_back({'X','O','X'});
//	a.push_back({'O','X','O'});

	a.push_back({'O','O','O','O','O','O','O','O','X','O','O','O','O','O','X','O','O','O','O','O'});
	a.push_back({'O','O','O','O','O','O','O','X','O','O','O','O','O','O','O','O','O','O','O','O'});
	a.push_back({'X','O','O','X','O','X','O','O','O','O','X','O','O','X','O','O','O','O','O','O'});
	a.push_back({'O','O','O','O','O','O','O','O','O','O','O','O','O','O','O','O','O','X','X','O'});
	a.push_back({'O','X','X','O','O','O','O','O','O','X','O','O','O','O','O','O','O','O','O','O'});
	a.push_back({'O','O','O','O','X','O','O','O','O','O','O','X','O','O','O','O','O','X','X','O'});
	a.push_back({'O','O','O','O','O','O','O','X','O','O','O','O','O','O','O','O','O','O','O','O'});
	a.push_back({'O','O','O','O','O','O','O','O','O','O','O','O','O','X','O','O','O','O','O','O'});
	["O","O","O","O","O","O","O","O","O","O","O","O","O","O","O","O","O","O","X","O"],["O","O","O","O","O","X","O","O","O","O","O","O","O","O","O","O","O","O","O","O"],["O","O","O","O","O","O","O","O","X","O","O","O","O","O","O","O","O","O","O","O"],["O","O","O","O","X","O","O","O","O","X","O","O","O","O","O","O","O","O","O","O"],["O","O","O","O","O","O","O","O","X","O","O","O","O","O","O","O","O","O","O","O"],["X","O","O","O","O","O","O","O","O","X","X","O","O","O","O","O","O","O","O","O"],["O","O","O","O","O","O","O","O","O","O","O","X","O","O","O","O","O","O","O","O"],["O","O","O","O","X","O","O","O","O","O","O","O","O","X","O","O","O","O","O","X"],["O","O","O","O","O","X","O","O","O","O","O","O","O","O","O","X","O","X","O","O"],["O","X","O","O","O","O","O","O","O","O","O","O","O","O","O","O","O","O","O","O"],["O","O","O","O","O","O","O","O","X","X","O","O","O","X","O","O","X","O","O","X"],["O","O","O","O","O","O","O","O","O","O","O","O","O","O","O","O","O","O","O","O"}});
	solve(a);
	
	for(int i=0;i<(int)a.size();++i)
	{
		for(int j=0;j<(int)a[0].size();++j)
			cout<<a[i][j]<<',";
		cout<<endl;
	}
	return 0;
}

标签：liantong,130vejorigjeiorj,int,back,push,array,line
来源： https://blog.csdn.net/qigezuishuaide/article/details/120410412

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

ICode9

130vejorigjeiorj