第三题我认为是思维题 3.计算字符串中“iflytek”的序列种数 int findIflytek(string s) { int i = 0, f = 0, l = 0, y = 0, t = 0, e = 0, k = 0; for (int j = 0; j < s.size(); j++) { if (s[j] == 'i')i++; else if (s[j] == 'f')f += i; else if (s[j] == 'l')l += f; else if (s[j] == 'y')y += l; else if (s[j] == 't')t += y; ...