SDUT - 3712 插入排序

最新推荐文章于 2022-11-21 19:59:37 发布

Miracle_QSH

最新推荐文章于 2022-11-21 19:59:37 发布

阅读量236

点赞数 1

分类专栏：链表

本文链接：https://blog.csdn.net/Miracle_QSH/article/details/81699939

版权

链表专栏收录该内容

11 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#include <stdlib.h>
struct node
{
    int data;
    struct node *next;
};
int main()
{
    int n, i, m;
    while(scanf("%d", &n) != EOF)
    {
        struct node *h, *q, *p;
        h = (struct node *)malloc(sizeof(struct node ));
        h -> next = NULL;
        q = h;
        for(i = 0; i < n; i++)
        {
            p = (struct node *)malloc(sizeof(struct node ));
            p -> next = NULL;
            scanf("%d", &p -> data);
            q -> next = p;
            q = p;
        }
        scanf("%d", &m);
        for(i = 0; i < m; i++)
        {
            int cmd;
            scanf("%d", &cmd);
            if(cmd == 1)
            {
                p = (struct node *)malloc(sizeof(struct node ));
                p -> next = NULL;
                scanf("%d", &p -> data);
                q = h;
                while(q -> next)
                {
                    if(q -> next -> data > p -> data)break;
                    q = q -> next;
                }
                p -> next = q -> next;
                q -> next = p;
            }
            else
            {
                p = h -> next;
                printf("%d", p -> data);
                p = p -> next;
                while(p)
                {
                    printf(" %d", p -> data);
                    p = p -> next;
                }
                printf("\n");
            }
        }
        p = h;
        while(p)
        {
            q = p -> next;
            free(p);
            p = q;
        }
    }
    return 0;
}