#include<bits/stdc++.h>
using namespace std;
int main()
{
string s, s1, s2 ;
char c;
while (cin >> c && c != ',') s += c;
while (cin >> c && c != ',') s1 += c;
while (cin >> c) s2 += c;
if (s.size() < s1.size() || s.size() < s2.size()) puts("-1");
else
{
int l = 0;
while ( l + s1.size() <= s.size() )
{
int k = 0;
while(k < s1.size())
{
if (s[k + l] != s1[k])
break;
k ++ ;
}
if (k == s1.size()) break;
l ++ ;
}
int r = s.size() - s2.size();
while ( r > 0 )
{
int k = 0;
while ( k < s2.size() )
{
if (s[r + k] != s2 [k])
break;
k ++ ;
}
if (k == s2.size()) break;
r -- ;
}
l += s1.size() - 1;
if (l > r) puts("-1");
else cout << r - l - 1 <<endl;
}
return 0;
}
Acwing778. 字符串最大跨距
最新推荐文章于 2024-08-20 00:47:47 发布