Two-gram CodeForces - 977B (水题 map+substr)

B. Two-gram
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Two-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.

Input

The first line of the input contains integer number nn (2n1002≤n≤100) — the length of string ss. The second line of the input contains the string ss consisting of nn capital Latin letters.

Output

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.

Examples
input
Copy
7
ABACABA
output
Copy
AB
input
Copy
5
ZZZAA
output
Copy
ZZ
Note

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.

题意:给出一个字符串,求出现次数最多的连续的两个字符。(注意:AAA 中  AA出现了两次)

思路:一个for循环,用map依次记录连续的两个字符的个数


#include<bits/stdc++.h>
using namespace std;
map<string,int>mp;
string ans,s;
int main()
{
    int n,max=-1;
    cin>>n>>s;
    for(int i=1;i<s.size();++i) mp[s.substr(i-1,2)]++;//s.substr(i-1,2)函数是从s中从i-1个字符开始取出长为2的串
    for(auto&x:mp) if(x.second>max) ans=x.first,max=x.second;//遍历map,更新ans
    cout<<ans<<endl;
    return 0;
}

阅读更多
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页