2468. Counting Letters

两次过，题目要求求出输入字符串中出现频率最高的字符并将其按字母顺序打印出来。

我学到的知识：1. 先将字符串按字母顺序排列，用sort排列；

                            2. 用一个数组记录每个字母出现的频率，因为排序后可相同的字母相邻，故简单了许多。

As a talented student, your boss gave you a task. Given a text string, you should find out which letters appear most frequently.

Really simple, isn't it?

Input

The first line of the input is the number of test cases. Then some test cases followed.

Each test case contains only one line, indicating the string mentioned above.

You can assume there is only lower case letters in the string. The length of the string is more than 0 and no more than 100.

Output

You should output one line for each test case, indicating the most frequent letters. Please note there may be more than one such letter, so you should output all of them, and these letters should be in the same order as the alphabet, that is, 'a', 'b', 'c', 'd' ... 'z'.

Sample Input

2
abcda
tjucstju

Sample Output

a
jtu

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
	int n,l,j,sum,count[100];
	char a[101],b[101],c;
	cin>>n;
	while(n--){
		memset(count,0,sizeof(count));
		cin>>a;
		l=strlen(a);
		sort(a,a+l);
		//for(int i=0;i<l;i++)
		//	cout<<a[i]<<" ";
		//cout<<endl;
		for(int i=0;i<l;i++){
			sum=a[i]-'a';
			count[sum]++;
		}
		
			
		int max=0;
		for(int i=0;i<=26;i++){
			if(max<count[i])
				max=count[i];
		}
		//cout<<1+'0'<<endl;
		for(int i=0;i<=26;i++){
			if(count[i]==max){
				c=i+'a';
				cout<<c;
			}
		}
		cout<<endl;
	

	}
	return 0;
}