wo-gram is an ordered pair (i.e. string of length two) of capital Latin letters. For example, "AZ", "AA", "ZA" — three distinct two-grams.
You are given a string ss consisting of nn capital Latin letters. Your task is to find any two-gram contained in the given string as a substring(i.e. two consecutive characters of the string) maximal number of times. For example, for string ss = "BBAABBBA" the answer is two-gram "BB", which contained in ss three times. In other words, find any most frequent two-gram.
Note that occurrences of the two-gram can overlap with each other.
The first line of the input contains integer number nn (2≤n≤1002≤n≤100) — the length of string ss. The second line of the input contains the string ss consisting of nn capital Latin letters.
Print the only line containing exactly two capital Latin letters — any two-gram contained in the given string ss as a substring (i.e. two consecutive characters of the string) maximal number of times.
7 ABACABA
AB
5 ZZZAA
ZZ
In the first example "BA" is also valid answer.
In the second example the only two-gram "ZZ" can be printed because it contained in the string "ZZZAA" two times.
题意:统计字符串中出现AB AA BA类型的子字符串中出现次数最多的是哪个
思路:map实现,刚开始想的是全部用map存储后,再通过string索引来查询,但是后来发现相对难以实现,所以采用的是边存贮边查询
#include <bits/stdc++.h>
using namespace std;
map<string, int >mp;
int main()
{
int n,maxx=0;
char s[105];
cin>>n;
cin>>s;
string res;
for(int i=0;i<n-1;i++){
string tmp="";
tmp.push_back(s[i]);
tmp.push_back(s[i+1]);
mp[tmp]++;
if(mp[tmp]>maxx){
maxx=mp[tmp];
res=tmp;
}
}
cout<<res<<endl;
return 0;
}