数据统计

r囧r小猫 2022-11-12 01:46 195阅读 0赞

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70][]

#include<stdio.h>
    #include<stdlib.h>
    struct Node
    {
        short number;
        struct Node* next;
    };
    struct Node *head;//头指针
    struct Node *rear;//尾指针
    int X[21]={0};//统计每个数字出现的次数
    int create_List()//创建头结点
    {
        struct Node* p=(struct Node*)malloc(sizeof(struct Node));
        if(p!=NULL)
        {
            head=p;
            rear=p;
            p->number=0;
            p->next=NULL;
            return 1;
        }//初始化后头指针和尾指针都指向头结点
        else
        {
            printf("头结点创建失败!\n");
            return 0;
        }
    }
    void insert_Node(short n)//插入一个结点到链表中
    {
        struct Node* p;
        p=(struct Node*)malloc(sizeof(struct Node));
        p->number=n;
        p->next=NULL;
        rear->next=p;
        rear=p;
        return ;
    }
    int Traversal()//遍历链表并统计表内元素个数
    {
        int i=0;
        struct Node* p=head->next;
        while(p!=NULL)
        {
            //printf("%hd ", p->number);
            i++;
            p=p->next;
        }
        //printf("\n");
        return i;
    }
    void f()//遍历链表并统计每个数字(0≤N≤20)出现的次数
    {
        struct Node* p=head->next;
        while(p!=NULL)
        {
            switch(p->number)
            {
                case 0: X[0]++; break;
                case 1: X[1]++; break;
                case 2: X[2]++; break;
                case 3: X[3]++; break;
                case 4: X[4]++; break;
                case 5: X[5]++; break;
                case 6: X[6]++; break;
                case 7: X[7]++; break;
                case 8: X[8]++; break;
                case 9: X[9]++; break;
                case 10: X[10]++; break;
                case 11: X[11]++; break;
                case 12: X[12]++; break;
                case 13: X[13]++; break;
                case 14: X[14]++; break;
                case 15: X[15]++; break;
                case 16: X[16]++; break;
                case 17: X[17]++; break;
                case 18: X[18]++; break;
                case 19: X[19]++; break;
                case 20: X[20]++; break;
            }
            p=p->next;
        }
        return ;
    }//f()函数和Traversal()函数可合并
    int main()
    {
        short n;
        int i=0;
        if(create_List()==1)//创建头结点成功
        {
            while(1)
            {
                scanf("%hd", &n);
                insert_Node(n);
                if(getchar()=='\n')
                {
                    break;
                }
            }
            printf("%d\n", Traversal());
            //
            f();
            //
            while(i<21)
            {
                if(i!=20)
                {
                    printf("%d ", X[i]);
                }
                else
                {
                    printf("%d\n", X[i]);
                }
                i++;
            }
        }
        else
        {
            ;
        }
        return 0;
    }

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 1][]

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70]: /images/20221022/99be12c1cc9f4154a20d8a61984fb876.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 1]: /images/20221022/7ec18ddf572d46779b88ee1f1aa125e3.png