2023\2\7号作业

1.随机出入N个单字符（无序）,输出升序的结果

1. main.c

#include "head.h"
//随机出入N个单字符（无序）,输出升序的结果 
int main(int argc, const char *argv[])
{
//有序单链表
//创建头结点
    selist s=touchaungjian();
//普通结点的创
//输ru
    char e;int n;
    printf("输入你要存入的个数\n");
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        getchar();
        printf("输入你要存入的数据: ");
        scanf("%c",&e);
        paixu(s,e);
    }
//输出升序的结果
    shuchu(s);
    return 0;
}

2.test.c

#include "head.h"
//创建头结点
selist touchaungjian()
{
    selist s=(selist)malloc(sizeof(nary));
    if(s==NULL)
    {
        printf("申请失败\n");
        return NULL;
    
    }
    s->len=0;
    s->next=NULL;
    return s;
}
//创建普通结点
selist puchuangjian()
{
    selist s=(selist)malloc(sizeof(nary));
    if(s=NULL)
    {
        printf("申请失败\n");
        return NULL;
    }
    s->date='0';
    s->next=NULL;
}

//输入后排序
void paixu(selist s,char e)
{
    selist p=touchaungjian();
    p->date=e;
    if(s->next==NULL)
    {
        p->next=s->next;
        s->next=p;
        s->len++;
    }
    else
    {
        selist t=s;
    for(int i=0;i<s->len;i++)
    {
        if(p->date>t->next->date)
        {
            p->next=t->next;
            t->next=p;
            s->len++;
            return;
        } 
        t=t->next;
    }
        p->next=s->next;
        s->next=p;
        s->len++;
    }
}
//输出升序的结果
void shuchu(selist s)
{
    selist p=s;
    for(int i=0;i<s->len;i++)
    {
        p=p->next;
        printf("%c\t",p->date);
    }
    printf("\n");
}

3.head.h

#ifndef __HEAD_H__
#define __HEAD_H__
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef char datepute;
typedef struct node
{
    union
    {
        int len;
        datepute date;
    };
    struct node *next;
}*selist,nary;
selist puchuangjian();
selist touchaungjian();
void shuchu(selist s);
void paixu(selist s,char e);
#endif