【PAT甲级】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个字符串的最长公共后缀子串

思路：使用string+substr()模拟， 技巧：每次取最短公共后缀子串

代码：

#include <iostream>
#include <sstream>
#include <string>
#include <cstdio>
#include <queue>
#include <cstring>
#include <map>
#include <cstdlib>
#include <stack>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define mem(a,n) memset(a,n,sizeof(a))
#define DBGS() cout<<"START\n"
#define DBGE() cout<<"END\n"
const int N = 256+5;
const ll INF = 0x3f3f3f3f;
const double eps=1e-4;

int main() {
    int n;
    string str,ans;
    cin>>n;
    getchar();
    for(int k=0; k<n; k++) {
        getline(cin,str);
        reverse(str.begin(),str.end());
        if(!k) {
            ans=str;
            continue;
        }
        for(int i=0; i<str.size(); i++) {
            if(ans[i]!=str[i]) {
                ans=ans.substr(0,i);
                break;
            }
        }
    }
    reverse(ans.begin(),ans.end());
    if(!ans.size()) {
        cout<<"nai";
    } else {
        cout<<ans;
    }
    return 0;
}