1077 Kuchiguse (20分)
作者:CHEN, Yue
单位:浙江大学
代码长度限制:16 KB
时间限制:150 ms
内存限制:64 MB
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
题意:
找出语言中的末尾语气词。
思路:
由于是找所给字符串与末尾的语气词,所以可以先将字符串倒序,先设一个语气词temp,令他等于第一句话,然后让他一次对对比每句话,去相同的段最为temp的更新,等比完了temp不为空,则倒序输出它,不然输出nai
。
参考代码:
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
getchar();
vector<string> str(n);
for (int i = 0; i < n; i++) {
getline(cin, str[i]);
reverse(str[i].begin(), str[i].end());
}
string temp = str[0];
for (int i = 1; i < n; i++) {
for (int j = 0; j < temp.size() && j < str[i].size(); j++) {
if (temp[j] != str[i][j]) {
temp = str[i].substr(0, j);
break;
}
}
}
if (!temp.empty()) {
for (int i = temp.size() - 1; i >= 0; i--)
cout << temp[i];
} else cout << "nai";
return 0;
}
如有错误,欢迎指正