网易互娱的笔试-关于字符匹配的题目

#include<iostream>
#include<string>
#include<vector>
using namespace std;
bool up_test(vector<string> input,string haha,int rows,int cols)
{     for(int i=0;i<haha.size();i++)     {         if(input[rows-i][cols]!=haha[i])             return false;     }     return true;
}
bool down_test(vector<string> input,string haha,int rows,int cols)
{     for(int i=0;i<haha.size();i++)     {         if(input[rows+i][cols]!=haha[i])             return false;     }     return true;
}
bool left_test(vector<string> input,string haha,int rows,int cols)
{     for(int i=0;i<haha.size();i++)     {         if(input[rows][cols-i]!=haha[i])             return false;     }     return true;
}
bool right_test(vector<string> input,string haha,int rows,int cols)
{     for(int i=0;i<haha.size();i++)     {         if(input[rows][cols+i]!=haha[i])             return false;     }     return true;
}
bool up_left_test(vector<string> input,string haha,int rows,int cols)
{     for(int i=0;i<haha.size();i++)     {         if(input[rows-i][cols-i]!=haha[i])             return false;     }     return true;
}
bool up_right_test(vector<string> input,string haha,int rows,int cols)
{     for(int i=0;i<haha.size();i++)     {         if(input[rows-i][cols+i]!=haha[i])             return false;     }     return true;
}
bool down_left_test(vector<string> input,string haha,int rows,int cols)
{     for(int i=0;i<haha.size();i++)     {         if(input[rows+i][cols-i]!=haha[i])             return false;     }     return true;
}
bool down_right_test(vector<string> input,string haha,int rows,int cols)
{     for(int i=0;i<haha.size();i++)     {         if(input[rows+i][cols+i]!=haha[i])             return false;     }     return true;
}
int main()
{     vector<string> test;     int test_num=0;     int rows;     int cols;     int count=0;     vector<int> outall;     string test_string;     cin>>test_num;     for(int i=0;i<test_num;i++)     {         test.resize(0);         cin>>rows>>cols;         test.resize(rows);         count=0;         for(int j=0;j<rows;j++)         {             cin>>test[j];         }         cin>>test_string;         for(int x=0;x<rows;x++)             for(int y=0;y<cols;y++)             {                 if(test[x][y]==test_string[0])                 {                     if(y>=test_string.size())                     {                         ;//count=count+(int)left_test(test,test_string,x,y);                     }                     if(y<=(cols-test_string.size()))                     {                         count=count+(int)right_test(test,test_string,x,y);                     }                     if(x>=test_string.size())                     {                         ;//count=count+(int)up_test(test,test_string,x,y);                     }                     if(x<=(rows-test_string.size()))                     {                         count=count+(int)down_test(test,test_string,x,y);                     }                     if(y>=test_string.size()&&x>=test_string.size())                     {                         ;//count=count+(int)up_left_test(test,test_string,x,y);                     }                     if(y>=test_string.size()&&x<=(rows-test_string.size()))                     {                         ;//count=count+(int)down_left_test(test,test_string,x,y);                     }                     if(y<=(cols-test_string.size())&&x>=test_string.size())                     {                         ;//count=count+(int)up_right_test(test,test_string,x,y);                     }                     if(y<=(cols-test_string.size())&&x<=(rows-test_string.size()))                     {                         count=count+(int)down_right_test(test,test_string,x,y);                     }                 }             }             outall.push_back(count);     }     for(int i=0;i<test_num;i++)     {         cout<<outall[i]<<endl;     }     return 0;
}
/*
3
10 10
AAAAAADROW
WORDBBBBBB
OCCCWCCCCC
RFFFFOFFFF
DHHHHHRHHH
ZWZVVVVDID
ZOZVXXDKIR
ZRZVXRXKIO
ZDZVOXXKIW
ZZZWXXXKIK
WORD
3 3
AAA
AAA
AAA
AA
5 8
WORDSWOR
ORDSWORD
RDSWORDS
DSWORDSW
SWORDSWO
SWORD
*/

#网易#

全部评论

推荐最新楼层

ponyma

广东工业大学 C++

#include <cstdio> #include <cstdlib> #include <string> #include <iostream> #include <cstring> using namespace std; const int maxn = 100; enum DIR { RIGHT, LOW, RLOW }; int dfs(char maze[maxn][maxn], int m, int n, string s, string find, int idx, int x, int y, DIR d) { if (s == find) return 1; if (idx >= find.size()) return 0; if (s[idx] != find[idx]) return 0; int right = 0, low = 0, rlow = 0; if (d == RIGHT && y + 1 < n) { right = dfs(maze, m, n, s + maze[x][y + 1], find, idx + 1, x, y + 1, RIGHT); } if (d == LOW && x + 1 < m) { low = dfs(maze, m, n, s + maze[x + 1][y], find, idx + 1, x + 1, y, LOW); } if (d == RLOW && x + 1 < m && y + 1 < n) { rlow = dfs(maze, m, n, s + maze[x + 1][y + 1], find, idx + 1, x + 1, y + 1, RLOW); } return right + low + rlow; } int main() { int t; char maze[maxn][maxn]; string find; cin >> t; while (t--) { memset(maze, 0, sizeof(maze)); int m, n; cin >> m >> n; for (int i = 0; i < m; ++i) { cin >> maze[i]; } cin >> find; int ans = 0; for (int i = 0; i < m; ++i) { for (int j = 0; j < n; ++j) { string s(""); int r = dfs(maze, m, n, s + maze[i][j], find, 0, i, j, RIGHT); int l = dfs(maze, m, n, s + maze[i][j], find, 0, i, j, LOW); int rl = dfs(maze, m, n, s + maze[i][j], find, 0, i, j, RLOW); ans = ans + r + l + rl; } } cout << ans << endl; } return 0; }

网易互娱的笔试-关于字符匹配的题目

全站热榜