1005. Spell It Right (20)

原题连接：https://www.patest.cn/contests/pat-a-practise/1005

这道题我是将读入的数处理后进行相加，然后统计总数的位数，然后将总数不断的取余、模10，每次余数入栈，最后进行输出。

总的来说我的思路以及方法还是稍有繁琐，尤其是输出那块。代码如下：

#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
typedef struct SNode{
    int Data;
    struct SNode *Next;
}Stack;

Stack *CreatStack()
{
    Stack *S=malloc(sizeof(struct SNode));
    S->Next=NULL;
    return S;
}

void Push(Stack *S,int X)
{
    Stack *cell=malloc(sizeof(struct SNode));
    cell->Data=X;
    cell->Next=S->Next;
    S->Next=cell;
}
bool IsEmpty(Stack *S)
{
    return (S->Next==NULL);
}
int  Pop(Stack *S)
{
    if (!IsEmpty(S)){
    int X;
    Stack*Tmpcell=malloc(sizeof (struct SNode));
    Tmpcell=S->Next;
    X=Tmpcell->Data;
    S->Next=Tmpcell->Next;
    free(Tmpcell);
    return X;}
}

int main()
{
    char c;
    int  s=0;
    int X,Data;
    Stack *S;
    S=CreatStack();

    while ((c=getchar())!='
')
    {
        s+=c-'0';
    }

    int tmp=s;
    int cnt=1;
    while((tmp/=10))cnt++;

    while(cnt--){
    X=s%10;
    Push(S,X);
    s/=10;
    }

    int flag=0;
    while (!IsEmpty(S))
    {
        Data=Pop(S);
        switch (Data)
        {
            case 1:
            {
                if (!flag){printf("one");flag=1;}
                else printf(" one");
            }break;
            case 2:
            {
                if (!flag){printf("two");flag=1;}
                else printf(" two");
            }break;
            case 3:
            {
                if (!flag){printf("three");flag=1;}
                else printf(" tree");
            }break;
            case 4:
            {
                if (!flag){printf("four");flag=1;}
                else printf(" four");
            }break;
            case 5:
            {
                if (!flag){printf("five");flag=1;}
                else printf(" five");
            }break;
            case 6:
            {
                if (!flag){printf("six");flag=1;}
                else printf(" six");
            }break;
            case 7:
            {
                if (!flag){printf("seven");flag=1;}
                else printf(" seven");
            }break;
            case 8:
            {
                if (!flag){printf("eight");flag=1;}
                else printf(" eight");
            }break;
            case 9:
            {
                if (!flag){printf("nine");flag=1;}
                else printf(" nine");
            }break;
            case 0:
            {
                if (!flag){printf("zero");flag=1;}
                else printf(" zero");
            }break;
        }
    }
    return 0;
}

然后参考了他人的代码，别的不说，单就输出那块用了hash映射是我需要学习和掌握的地方：

#include<stdio.h>
int main()
{
    char str[10][6]={"zero", "one", "two", "three", "four", "five", "six",
        "seven", "eight", "nine"};
    int arr[5];
    int index=0;

    char ch;
    int sum=0;
    while (1)
    {
        scanf("%c",&ch);
        if (ch>='0' && ch<='9')sum+=(ch-'0');
        else if (ch=='
')break;
    }
    if (sum==0){printf("zero");return 0;}
    while(sum)
    {
        arr[index++]=sum%10;
        sum/=10;
    }
    int i;
    for(i=index-1;i>=0;i--)
    {
        printf("%s",str[arr[i]]);
        if (i)printf(" ");
    }
    return 0;
}