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
最长公共子串问题,只不过限定在后缀,思路就是:对第一个字符串不断进行截取.最终结果就是最长公共后缀
思路描述错误/对先比较产生一个两个串公共子串,然后不断输入再截取公共子串/
//参考了一点柳神的思路
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
string s1, s2;
scanf("\n");
getline(cin, s1);
for(int i = 0; i < n - 1; i++){
scanf("\n");
getline(cin, s2);
int len1 = s1.length();
int len2 = s2.length();
for(int j = 0; j < len2 && j < len1; j++){
if(s2[len2 - 1 - j] != s1[len1 - 1 - j]){
s1 = s1.substr(len1 - j);//len1-0时即实现为空;然后跳出
break;//不跳出一直在一次循环内重复与同一串比较截取
}
}
}
if(s1 != "")
cout << s1;
else cout << "nai";
return 0;
}
柳神思路https://www.liuchuo.net/archives/2065
#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;
}//分析:因为是后缀,反过来比较太麻烦,所以每输入一个字符串,就把它逆序过来再比较会比较容易~
首先ans = s;后来每输入的一个字符串,都和ans比较,如果后面不相同的就把它截取掉,最后输出ans即可(要逆序输出~,所以先将ans倒置reverse一下~)