【PAT】【Advanced Level】1077. Kuchiguse (20)

最新推荐文章于 2022-01-29 16:54:04 发布

old_杨

最新推荐文章于 2022-01-29 16:54:04 发布

阅读量288

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/oldyang95/article/details/77603434

版权

PAT 专栏收录该内容

132 篇文章 0 订阅

订阅专栏

1077. Kuchiguse (20)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

HOU, Qiming

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

原题链接：

https://www.patest.cn/contests/pat-a-practise/1077

https://www.nowcoder.com/pat/5/problem/4307

思路：

刚开始把简单的思路弄的十分复杂。。

被样例绕进去了。

其实思路很简单

扫描所有后缀子串，用map记录出现的次数。

最后排序后，检测最大次数是否是N即可

坑点：

题意的理解

CODE：

#include<iostream>
#include<cstdio>
#include<string>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
vector<string> vec;
map<string,int> ma;
bool cmp(string a,string b)
{
	if (ma[a]==ma[b])
		return a.length()>b.length();
	else
		return ma[a]>ma[b];
}
int main()
{
	int n;
	cin>>n;
	getchar();
	for (int i=0;i<n;i++)
	{
		string t;
		getline(cin,t);
		for (int j=0;j<t.length();j++)
		{
			string temp;
			temp=t.substr(j,t.length()-j);
			if (ma[temp]==0)
			{
				vec.push_back(temp);
				ma[temp]=1;
			}
			else
			{
				ma[temp]++;
			}
		}
	}
	sort(vec.begin(),vec.end(),cmp);
	if (ma[vec[0]]!=n)
	{
		cout<<"nai";
	}
	else
		cout<<vec[0];
	return 0;
}