1077 Kuchiguse
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
总结:还有最后一个测试点没有通过,越改越错,唉(知道哪里出错了,原来是getchar()我放在了循环当中,导致每次循环都会执行getchar(),会读取下一个字符串的第一个字符)
代码:
#include <iostream>
using namespace std;
int main(){
int n,max=0;
scanf("%d",&n);
string s[110];
string t;
for(int i=0;i<n;i++){
getchar();//应该放在循环外面的
getline(cin,s[i]);
max=max<s[i].size()?s[i].size():max;
}
bool sign=true;
for(int i=0;i<max;i++){
char c=s[0].back();
s[0].pop_back();
for(int j=1;j<n;j++){
if(s[j].back()==c) s[j].pop_back();
else{
sign=false;
break;
}
}
if(!sign) break;
else t=c+t;
}
if(!t.size()) printf("nai\n");
else cout << t << endl;
}
学习一下柳神的代码:
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
scanf("%d\n", &n);
string ans;
for(int i = 0; i < n; i++) {
string s;
getline(cin, s);
int lens = s.length();
reverse(s.begin(), s.end());
if(i == 0) {
ans = s;
continue;
} else {
int lenans = ans.length();
if(lens < lenans) swap(ans, s);
int minlen = min(lens, lenans);
for(int j = 0; j < minlen; j++) {
if(ans[j] != s[j]) {
ans = ans.substr(0, j);
break;
}
}
}
}
reverse(ans.begin(), ans.end());
if (ans.length() == 0) ans = "nai";
cout << ans;
return 0;
}
好好学习,天天向上!
我要考研!