题目描述
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?
输入描述:
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.
输出描述:
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".
输入例子:
3
Itai nyan~
Ninjin wa iyadanyan~
uhhh nyan~
输出例子:
nyan~
#include <iostream>
#include <string>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
/*
题目大意:给几个字符串,匹配他们尾部的最长子字符串。
解决方法:反转字符串并依次匹配
*/
int main()
{
int n;
//ifstream fin("test.txt");
string temp;
string maxString;
vector<string> svec;
cin >> n;
getline(cin, temp); //去掉回车,否则会输出一个回车
while(n--)
{
getline(cin, temp);
reverse(temp.begin(),temp.end());
//把反转之后的字符串都存起
svec.push_back(temp);
}
string stemp = svec[0];
//从某个字符串的头开始进行匹配
for (int i = 0; i < stemp.size(); i++)
{
bool flag = true;
//与其他的字符串相应位置的字符进行匹配
for (int j = 1; j < svec.size();j++)
if (svec[j][i] != stemp[i])
{
flag = false;
break;
}
if (flag)
maxString += stemp[i]; //所有字符串都有,添加到最终的结果字符串中
else
break;
}
//判断最后的匹配
if (maxString.empty())
cout << "nai" << endl;
else
{
reverse(maxString.begin(), maxString.end());
cout << maxString;
}
//getchar();
}