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 s
consisting of n 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 s = " BBAABBBA" the answer is two-gram " BB", which contained in sthree times. In other words, find any most frequent two-gram.
Note that occurrences of the two-gram can overlap with each other.
InputThe first line of the input contains integer number n
( 2≤n≤100) — the length of string s. The second line of the input contains the string s consisting of ncapital Latin letters.
OutputPrint the only line containing exactly two capital Latin letters — any two-gram contained in the given string s
as a substring (i.e. two consecutive characters of the string) maximal number of times.
Examples7 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.
题意:求出现次数最多的two-gram的子串,一个two-gram串是指在原字符串中出现的连续的两个字母思路:开一个二维数组dp[x][y]表示str[x]str[y]构成的two-gram串出现的次数
代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
int dp[30][30];
int main(){
int n;
string str;
cin>>n>>str;
for(int i=0;i<n-1;i++){
int x=str[i]-'A';
int y=str[i+1]-'A';
dp[x][y]++;
}
int maxt=0,Last=0,Next=0;
for(int i=0;i<26;i++)
for(int j=0;j<26;j++){
if(maxt<dp[i][j]){
Last=i;
Next=j;
maxt=dp[i][j];
}
}
printf("%c%c\n",Last+'A',Next+'A');
return 0;
}