随机输入一串字符，统计里面出现次数最多的字符，再按照出现次数由多到少的顺序输出

1.用数组存储字符出现的次数
2.通过for循环来找出最大次数的字符
3.通过冒泡排序将次数由多到少排序
4.用for循环和if判断将相同的次数排在一起

#include "stdio.h"
#include "string.h"
#include "stdlib.h"
#define n 100
int b[n];
int max = 0;
int t2 = 0;
int t1 = 0;
int index = 0;
int len = 0;
void sum(char a[], int len)
{

	for(int i = 0; i < len; i++)
	{
		for (int j = 0; j < len; j++)
		{
			if (a[i]== a[j])
			{
				b[j]++;
			}
		}
	}
	max = b[0];
	for (int j = 0; j < len; j++)
	{
		if (b[j] > max)
		{
			max = b[j];
			index = j;
		}
	}
	printf("%c\n", a[index]);
	for(int i = 0; i <len-1; i++)
	{
		for(int j = 0; j < len-i-1 ; j++)
		{
			if (b[j] < b[j + 1])
			{
				t2 =  b[j];
				b[j] = b[j + 1];
				b[j + 1] = t2; 
				t1 = a[j];
				a[j] = a[j + 1];
				a[j + 1] = t1;
			}
		
		}
	}
	for (int j = 0; j < len; j++)
	{
		printf("%d\n", b[j]);
	}
	for (int i = 0; i < len; i++)
	{
		for (int j =i; j < len ; j++)
		{
			while(a[i] != a[j] && b[i] == b[j] && j < len)
			{
				j++;
				if (a[i] == a[j])
				{
					t1 = a[i + 1];
					a[i + 1] = a[j];
					a[j] = t1;
				}
			}
		}
	}
	for(int j = 0; j < len; j++)
	{
		printf("%c\n", a[j]);
	}
}
int main()
{
	char a[n];
	gets_s(a);
	len = strlen(a);
	sum(a, len);
	return 0;
}