题解 | #统计回文#

#include <iostream>
#include<string>
#include<algorithm>
using namespace std;


bool IsCircle(string s)
{
    int begin = 0;
    int end = s.size() - 1;
    while (begin < end)
    {
        if (s[begin++] != s[end--])
        {
            return false;
        }
    }
    return true;
}

int main() {
    string s1, s2, s3;
    cin >> s1 >> s2;
    int count = 0;
    int n = s1.size();
    for (int i = 0; i <= n; i++)
    {
        int falg = 1;
        s3 = s1;
        s3.insert(i, s2);

        //判断是否为回文
        if (IsCircle(s3))
        {
            count++;
        }

    }
    cout << count << endl;
    return 0;
}
// 64 位输出请用 printf("%lld")