A-1077 Kuchiguse (20 分)

最新推荐文章于 2022-02-07 14:54:12 发布

原创最新推荐文章于 2022-02-07 14:54:12 发布 · 163 阅读

0 ·

CC 4.0 BY-SA版权

PTA 专栏收录该内容

72 篇文章

订阅专栏

本文介绍了一个算法挑战，旨在通过分析角色对话来识别其特有的口头禅或结束语。输入包括几行角色的台词，输出是最长的共同结尾部分，即口头禅。若无共同结尾，则输出特定提示。

A-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

#include <string>
#include <iostream>
using namespace std;

int main(){
    int n,i,j,x;
    cin >> n;
    getchar();//吸收回车
    int w[n]={};
    string str[n]={};
    string camp;
    for(i=0;i<n;i++){
        getline(cin,str[i]);
        w[i]=str[i].size();//存储每个字符串的长度
    }
    camp=str[0];//camp为比较字段
    x=w[0];
    for(i=0;i<n;i++){
        for(j=0;j<w[i];j++){
            if(camp[camp.size()-j-1]!=str[i][w[i]-j-1])break;//从末尾开始比较，如果遇到不一样的就退出这层循环
        }
        if(j<x){//此时的j为相同字段的长度，如果相同字段比原先减小的话，就要删除camp的头x-j个字符
            camp.erase(camp.begin(),camp.end()-j);
            x=j;
        }
    }
    if(camp.size()!=0)cout << camp;//如果camp的长度不为零就输出camp
    else cout << "nai";//否则输出nai
    return 0;
}