SDUTACM 数据结构实验之链表六：有序链表的建立

Problem Description

Input

Output

Example Input

6
33 6 22 9 44 5

Example Output

5 6 9 22 33 44

Hint

#include<stdio.h>
#include<stdlib.h>
struct hh
{
int data;
struct hh *next;
};
int main()
{
struct hh *head,*p,*t;
int n,i,x;
head=(struct hh *)malloc(sizeof(struct hh));
head->next=NULL;
t=head;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&x);
while(t->next!=NULL&&t->next->data<x)
t=t->next;
p=(struct hh *)malloc(sizeof(struct hh));
p->data=x;
p->next=t->next;
t->next=p;
t=head;
}
p=head->next;
for(i=0;i<n-1;i++)
{
printf("%d ",p->data);
p=p->next;
}
printf("%d\n",p->data);
return 0;
}