PAT甲1077字符串

题目链接
1077 Kuchiguse (20分)
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

题意：
给n个字符串，求出它们的最长公共后缀，如果不存在的话，就输出”nai”；

题解：
可以反转一下。然后取出第一个字符串的第一位，判断与剩下的所有字符串是否相同，如果相同，则继续判断，直到不同为止。

代码：

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
vector<char> v;
string s[105];
int main()
{
	int n,len=10000;
	cin>>n;
	getchar();
	for(int i=1;i<=n;i++)
	{
		getline(cin,s[i]);
		reverse(s[i].begin(),s[i].end());
		int t=s[i].length();
		len=min(len,t);
	}
	for(int i=0;i<len;i++)
	{
		int flag=1;
		char temp=s[1][i];
		for(int j=2;j<=n;j++)
		{
			if(s[j][i]!=temp)
			{
				flag=0;
				break;
			}
		}
		if(flag==1)
			v.push_back(temp);
		else
			break;
	}
	if(v.size()==0)
		cout<<"nai";
	else
	{
		for(int i=v.size()-1;i>=0;i--)
			cout<<v[i];
	}
}