PAT 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

思路: 每次输入一个新的字符串就和前面所得到的后缀进行匹配，得到新的后缀，然后重复；由于N规定大于2，所以第一次输入的这个后缀可以当第一次得到后缀的结果与后面进行匹配。

坑点：输入的字符串有空格，要用getline输入

代码:

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
string str[100];
string suffix;
int n;
int main(){
    
    cin>>n;
     cin.ignore();//不可少
    getline(cin,suffix);
    for(int k=1;k<n;++k){
        getline(cin,str[k]);
        int i=suffix.length()-1,j=str[k].length()-1;
        while(i>=0 && j>=0){
            if(suffix[i] == str[k][j]){
                i--;j--;
            }else{
                break;
            }
        }
        suffix=suffix.substr(i+1);
    }
    if(suffix == ""){
        cout<<"nai"<<endl;
    }else{
        cout<<suffix<<endl;
    }
    return 0;
}