A.小红的环形字符串思路:将s字符串扩大两倍之后,在其之中寻找有几个字串等于t字符串。 void solve() { string s, t; cin >> s >> t; s = s + s; int c = t.size(); int n = s.size(); int cnt = 0; for (int i = 0; i < n / 2; ++i) { string sub = s.substr(i, c); if (sub == t) { cnt++; } } cout << cnt << ...