问题
The Japanese language is notorious for its sentence ending particles. Personal preference of such particles can be considered as a reflection of the speaker’s personality. Such a preference is called “Kuchiguse” and is often exaggerated artistically in Anime and Manga. For example, the artificial sentence ending particle “nyan~” is often used as a stereotype for characters with a cat-like personality:
Itai nyan~ (It hurts, nyan~)
Ninjin wa iyada nyan~ (I hate carrots, nyan~)
Now given a few lines spoken by the same character, can you find her Kuchiguse?
Input Specification:
Each input file contains one test case. For each case, the first line is an integer N (2≤N≤100). Following are N file lines of 0~256 (inclusive) characters in length, each representing a character’s spoken line. The spoken lines are case sensitive.
Output Specification:
For each test case, print in one line the kuchiguse of the character, i.e., the longest common suffix of all N lines. If there is no such suffix, write nai.
Sample Input 1:
3
Itai nyan~
Ninjin wa iyadanyan~
uhhh nyan~
Sample Output 1:
nyan~
Sample Input 2:
3
Itai!
Ninjinnwaiyada T_T
T_T
Sample Output 2:
nai
解决方法
分析:字符串处理
这道题的目的是求最大后缀。后缀不好求,可以reverse,变成求最大前缀。
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
int n;
scanf("%d\n", &n);
string s, ans;
for (int i = 0; i < n; i++)
{
getline(cin, s);
reverse(s.begin(), s.end());
if (i == 0)
{
ans = s;
continue;
}
else
{
for (int j = 0; j < s.size() && j < ans.size(); j++)
{
if (s[j] != ans[j])
{
ans = ans.substr(0, j);
break;
}
}
}
}
reverse(ans.begin(), ans.end());
if (ans.size() == 0) ans = "nai";
cout << ans;
return 0;
}
后记
这道题,题目简单,解题思路也很简单。但是却是倒腾了很久,因为buffer里面的回车。scanf("%d\n", &n);
一定要吸收掉\n,不然输入的案例里面会有一个输入不进去。