深刻理解: 如果 aPbTc 是正确的,那么 aPbATca 也是正确的
可以用数学表达式写为:a(b + 1) = c + a
其中a, b, c, 1均为含有字符’A’ 的个数
**故可得len(a)len(b) = len(c)!
上代码:思路仿写了另一位博主的:https://blog.csdn.net/guaijiao3757/article/details/83048624?utm_medium=distribute.pc_relevant.none-task-blog-baidujs-1
#include <iostream>
#include <sstream>
using namespace std;
inline bool PAT(string s)
{
int nP = 0, nT = 0, nOther = 0;
int PPos = 0, TPos = 0, len = s.length();
for (int j = 0; j < len; j++) {
if (s[j] == 'P') {
nP++;
PPos = j;
}
else if (s[j] == 'T') {
nT++;
TPos = j;
}
else if (s[j] != 'A')
nOther++;
}
int x = PPos, y = TPos - PPos - 1, z = len - TPos - 1;
if (nP != 1 || nT != 1 || nOther != 0 || TPos - PPos <= 1)
return false;
else if (x * y == z)
return true;
else
return false;
}
int main() {
int n;
bool judge;
string tmp;
cin >> n;
while (n--) {
cin >> tmp;
judge = PAT(tmp);
if (judge) cout << "YES" << endl;
else cout << "NO" << endl;
}
}