lb.cpp

本代码实现的是简单的链表的建立

#include <stdlib.h> 

typedef struct node 
{ 
int data; 
struct node *next; 
}*Listlink; 

/*前插法创建单链表*/ 
void qian_create(Listlink *head,int n) 
{ 
int i; 
Listlink p; 
*head=(Listlink )malloc(sizeof(struct node)); 
(*head)->next=NULL;/*建立头结点*/ 
printf("input %d numbers:\n",n); 
for(i=0;i<n;i++) 
{ 
p=(Listlink)malloc(sizeof(struct node)); 
scanf("%d",&(p->data)); 

p->next=(*head)->next; 
(*head)->next=p; 
} 
} 
/*后插法创建单链表*/ 
void hou_create(Listlink *head,int n) 
{ 
int i; 
Listlink p,q; 
*head=(Listlink )malloc(sizeof(struct node)); 
(*head)->next=NULL;/*建立头结点*/ 
q=*head; 
for(i=0;i<n;i++) 
{ 
p=(Listlink)malloc(sizeof(struct node)); 
scanf("%d",&(p->data)); 

p->next=q->next; 
q->next=p; 
q=p; 
} 

} 

void print_list(Listlink head) 
{ 
Listlink p; 
p=head->next; 
while(p!=NULL) 
{ 
printf(" %d",p->data); 
p=p->next; 
} 
} 

main() 

{ 

Listlink la,lb,lc; 

puts("houcha:"); 
hou_create(&lb,10); 
puts("qiancha:"); 
qian_create(&la,10); 
print_list(la); 

print_list(lb); 
getch(); 


}