main.c

字符串计算公式

#include <stdio.h>
#include <stdlib.h>


int main()
{
	char str[1000];                             /*定义字符数组*/
	int i, count[26] = {0};

	scanf("%s", str);                           /*扫描输入的字符*/

	for(i = 0; i <= 1000; i++)                   /*用for循环记录每个字母出现的次数*/
	{
        if(str[i] == 'a')
            count[0]++;
        else if(str[i] == 'b')
            count[1]++;
        else if(str[i] == 'c')
            count[2]++;
        else if(str[i] == 'd')
            count[3]++;
        else if(str[i] == 'e')
            count[4]++;
        else if(str[i] == 'f')
            count[5]++;
        else if(str[i] == 'g')
            count[6]++;
        else if(str[i] == 'h')
            count[7]++;
        else if(str[i] == 'i')
            count[8]++;
        else if(str[i] == 'j')
            count[9]++;
        else if(str[i] == 'k')
            count[10]++;
        else if(str[i] == 'l')
            count[11]++;
        else if(str[i] == 'm')
            count[12]++;
        else if(str[i] == 'n')
            count[13]++;
        else if(str[i] == 'o')
            count[14]++;
        else if(str[i] == 'p')
            count[15]++;
        else if(str[i] == 'q')
            count[16]++;
        else if(str[i] == 'r')
            count[17]++;
        else if(str[i] == 's')
            count[18]++;
        else if(str[i] == 't')
            count[19]++;
        else if(str[i] == 'u')
            count[20]++;
        else if(str[i] == 'v')
            count[21]++;
        else if(str[i] == 'w')
            count[22]++;
        else if(str[i] == 'x')
            count[23]++;
        else if(str[i] == 'y')
            count[24]++;
        else if(str[i] == 'z')
            count[25]++;
    }

    /*以下为计算出现次数最多的字母的出现次数*/
    int MaxCount, j, k;

    MaxCount = count[0];

    for(j = 1; j < 26; j++)
    {
        if(count[j] > MaxCount)
        {
            MaxCount = count[j];
            k = j;
        }
    }
    printf("Max:\n");
    putchar(k + 97);
    printf(" %d\n", MaxCount);
    /*出现次数最多计算结束*/

    /*以下为将字母按出现次数排序的计算*/
    int p, q, temp1, temp2;

    printf("Sort:\n");
    for(p = 0; p < 25; p++)
    {
        for(q = p + 1; q < 26; q++)
        {
            if(count[q] > count[p])
            {
                temp1 = count[q];
                count[q] = count[p];
                count[p] = temp1;
            }
        }
    }

    for(p = 0; p < 26; p++)
    {
        printf("%d\n", count[p]);
    }
    /*次数排序计算完毕*/

	return 0;
}