递增的整数序列链表的插入

#include <stdio.h>

#include <stdlib.h>

typedef int ElementType;

typedef struct Node *PtrToNode;

struct Node {

ElementType Data;

PtrToNode Next;

};

typedef PtrToNode List;

List Read(); /* 细节在此不表 */

void Print( List L ); /* 细节在此不表 */

List Insert( List L, ElementType X );

int main()

{

List L;

ElementType X;

L = Read();

scanf("%d", &X);

L = Insert(L, X);

Print(L);

return 0;

}

List Read(){

int n,i;

scanf("%d",&n);

List head=(List)malloc(sizeof(PtrToNode));

head->Next=NULL;

if(n!=0)

{

List p=head;

for(i=0;i<n;i++){

List var=(List)malloc(sizeof(PtrToNode));

scanf("%d",&(var->Data));

p->Next=var;

p=var;

}

p->Next=NULL;

}

return head;

}

List Insert( List L, ElementType X ){

List Pre,Tmp;

Pre=L;

while(Pre->Next)

{

if(X<Pre->Next->Data) break;

else Pre=Pre->Next;

}

Tmp=(PtrToNode)malloc(sizeof(struct Node));

Tmp->Data =X;

Tmp->Next=Pre->Next;

Pre->Next=Tmp;

return L;

}

void Print( List L ){

L=L->Next;

if(L==NULL){

printf("NULL");

}

else{

while(L)

{

printf("%d ",L->Data);

L=L->Next;

}

}

printf("\n");

}