网易2017年3月26日中午的实习生招聘里面有道编程题,大概是说有一个围棋格子,每一个块为白色或黑色,小易会找出列方向上颜色相同并且连着的区域,并最长,将其涂为红色。第一行输入棋盘的大小,如3,后面依次是棋盘的颜色,w是white白色,b是black黑色
bwb
bbb
bww
那么很明显第一列有颜色相同且连着的区域,而且最长,为3,所以这个case应该输出3
我三道编程题就作出这一道。。。。。。下面是我的代码
#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
int get_max(vector<vector<char>> qipan, int i,int cols);
int main()
{
int cols = 0;
cin >> cols;
vector<vector<char>> qipan;
for (int i = 0; i < cols; i++)
{
vector<char> tmp;
for (int j = 0; j < cols; j++)
{
char x;
cin >> x;
tmp.push_back(x);
}
qipan.push_back(tmp);
}
int max = 0;
for (int i = 0; i < cols; i++)
{
int tmp = get_max(qipan, i, cols);
if (tmp > max)
max = tmp;
}
cout << max << endl;
return 0;
}
int get_max(vector<vector<char>> qipan, int i,int cols)
{
int max = 0;
int W_length = 0;
int B_length = 0;
for (int j = 0; j < cols; j++)
{
if (qipan[j][i] == 'W')
{
W_length += 1;
B_length = 0;
if (W_length > max)
max = W_length;
}
if (qipan[j][i] == 'B')
{
W_length = 0;
B_length += 1;
if (B_length > max)
max = B_length;
}
}
return max;
}