字符串环【字符串】

>Link

ybtoj字符串环

---

>解题思路

暴力处理第一个环的子串，在用c++自带函数寻找第二个环中有无此子串

---

>代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int lena, lenb, ans;
string a, b;

int main()
{
    
    
	cin >> a >> b;
	lena = a.size(), lenb = b.size();
	a.insert (lena, a); b.insert (lenb, b);
	lena *= 2, lenb *= 2;
	for (int i = 0; i < lena / 2; i++)
	  for (int j = i; j < lena; j++)
	  {
    
    
	  	if (j - i + 1 > lena / 2) break;
	  	char x[600] = {
    
    0};
	  	a.copy (x, j - i + 1, i);
	  	if (b.find (x) != string::npos)
	  	  ans = max (ans, j - i + 1);
	  }
	printf ("%d", ans);
	return 0;
}