Assignment > Count and Histogram

第一次打代码的时候，思路如下

#include<stdio.h>
int main(){
    int j = 0,i = 0,k = 0,keep = 0,m = 0,n = 0,h = 0,l=0;
    // count是用来计算每个字母个数的，初始化为0
    int count[27] = {0};
    //用以读取一个单词的all， 用以读取一个letter的get
    char all[400] = {' '},get = 0;
    //这是最下方的一行：twsx是twenty six二十六个字母
    char twsx[27] = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','W'};
    /*compute & find the repeat*/   

    for (i=0;i<=400,(get=getchar())!=EOF;i++){

    //当时还没有学习函数的读取，可以用strlen 或者。。。测定一下长度先
    //然后可以用scanf%s的形式，这样读到的将会是在空格截止

        scanf("%c",&all[i]);

        if (i>=1 && (int)all[i-1] == (int)' ' && (int)all[i]!= (int)' '||i>=1 && (int)all[i-1] == (int)'\n' && (int)all[i]!= (int)'\n'){
        count[26]++; 
        }
        switch(all[i]){
            case 'a':count[0]++; break;
            case 'b':count[1]++; break;
            case 'c':count[2]++; break;
            case 'd':count[3]++; break;
            case 'e':count[4]++; break;
            case 'f':count[5]++; break;
            case 'g':count[6]++; break;
            case 'h':count[7]++; break;
            case 'i':count[8]++; break;
            case 'j':count[9]++; break;
            case 'k':count[10]++; break;
            case 'l':count[11]++; break;
            case 'm':count[12]++; break;
            case 'n':count[13]++; break;
            case 'o':count[14]++; break;
            case 'p':count[15]++; break;
            case 'q':count[16]++; break;
            case 'r':count[17]++; break;
            case 's':count[18]++; break;
            case 't':count[19]++; break;
            case 'u':count[20]++; break;
            case 'v':count[21]++; break;
            case 'w':count[22]++; break;
            case 'x':count[23]++; break;
            case 'y':count[24]++; break;
            case 'z':count[25]++; break;
            default : continue;
        }

    }

    /*find the larest counter && cut down column if a letter dose not exist*/
    for (keep = 0,i=1;i<=26;i++){

        if (count[i]>=count[i-1]){
            keep = count [i];
        }else{
            keep = count [i-1];
        }

    }
    for(k = 0;k <= 25;k++){
        if(count[k]==0){
            n = n;
        }else{
            n++;
        }
    }

/*print a matrix of letter & '*'*/
    char fang[100][27]={' '}; 
    for (k=0;k<=n;k++){
        for(m=0;m<count[m];m++){
            fang[m][k]='*';
          // printf("%c",fang[m][k])    ;   
        }


    }
    for(h=keep;h>=0;h--){
        printf("%d\t%s\n",h+1,fang[h]);
        if (h==0){
            printf(" \t");
            for(l=0;l<=26;l++){
                if(l<26){
                    if(count[l]==0){
                        continue;
                    }else{
                        printf("%c",twsx[l]);

                    }   
                }else{
                    printf("W\n");
                }


            }
        }
    }
    return 0;
}