思路:
主函数
- 输入n;
- 根据for循环输入每个字符
再用for循环遍历查找‘y'字符,找到了进入深搜
int main()
{
cin >> n;
for (int i = 1;i <= n;i++) {
for (int j = 1;j <= n;j++) {
cin >> a[i][j];
}
}
for (int i = 1;i <= n;i++) {
for (int j = 1;j <= n;j++) {
if (a[i][j] == 'y')
dfs(i, j);
}
}
for (int i = 1;i <= n;i++) {
for (int j = 1;j <= n;j++) {
if (book[i][j] == 0) book[i][j] = '*';
cout << book[i][j];
}
cout << endl;
}
return 0;
}
dfs函数:
1.创建一个比较变量flag,赋值为1
2.
for (int i = 0;i < 8;i++) {
int flag = 1;
for (int j = 1;j <= 6;j++) {
int x1 = x + j * dx[i];
int y1 = y + j * dy[i];
if (x1<1 || x1>n || y1<1 || y1>n) {
flag = 0;
break;
}
if (a[x1][y1] != cmp[j]) {
flag = 0;
break;
}
}
其中第一个for循环,分别代表了8个方向
第二层循环则分别代表了第j个字母(j从1开始即’i')
在第二层循环中有两个条件语句:
(1)第一个判断是否越界
(2)第二个代表此时坐标对应的字母是否与题目要求的字母相同
当跳出此循环时共有两种情况:
(1)flag=0
(2)六个字母完全对应
因此要判断此时flag是否等于0,若相等则要退出当前i的循环,进入下一轮
若不等于0,则让另一个数组接受此时七个字母分别对应的位置坐标的值
for (int j = 0;j <= 6;j++) {
int x1 = x + j * dx[i];
int y1 = y + j * dy[i];
book[x1][y1] = a[x1][y1];
}
输出:遍历book数组,如果等于0,赋值为‘*’
然后输出
完整代码:
#include <iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int dx[] = { 0,0,1,-1,-1,1,-1,1 };
int dy[] = { 1,-1,0,0,-1,1,1,-1 };
int n,flag;
char book[105][105];
char a[105][105];
const string cmp = "yizhong";
void dfs(int x, int y) {
for (int i = 0;i < 8;i++) {
flag = 1;
for (int j = 1;j <= 6;j++) {
int x1 = x + j * dx[i];
int y1 = y + j * dy[i];
if (x1<1 || x1>n || y1<1 || y1>n) {
flag = 0;
break;
}
if (a[x1][y1] != cmp[j]) {
flag = 0;
break;
}
}
if (flag == 0) continue;
for (int j = 0;j <= 6;j++) {
int x1 = x + j * dx[i];
int y1 = y + j * dy[i];
book[x1][y1] = a[x1][y1];
}
}
}
int main()
{
cin >> n;
for (int i = 1;i <= n;i++) {
for (int j = 1;j <= n;j++) {
cin >> a[i][j];
}
}
for (int i = 1;i <= n;i++) {
for (int j = 1;j <= n;j++) {
if (a[i][j] == 'y')
dfs(i, j);
}
}
for (int i = 1;i <= n;i++) {
for (int j = 1;j <= n;j++) {
if (book[i][j] == 0) book[i][j] = '*';
cout << book[i][j];
}
cout << endl;
}
return 0;
}