关于链表的问题！

链表的创建！

等一下我吃饭去先。

#include <stdio.h> #include <stdlib.h> typedef struct _list { int val; struct _list* next; } *node, list; node Insert( node* head, node pos, int val ) { node tmp; tmp = ( node )malloc( sizeof( list ) ); tmp->val = val; tmp->next = pos ? pos->next : *head; if ( pos ) { pos->next = tmp; } else { *head = tmp; } return tmp; } node Create( int* beg, int* end ) { node head, t; head = t = NULL; while ( beg != end ) { t = Insert( &head, t, *beg++ ); } return head; } void Print( node head ) { while ( head ) { printf( "%d ", head->val ); head = head->next; } putchar( '\n' ); } int main() { int a[] = { 6,1,3,9,2,8,5,0,7,4 }; node head; head = Create( a, a + 10 ); Print( head ); getchar(); return 0; }

#include <stdlib.h> /包*含ma l l o c ( ) 的头文件*/ #include <stdio.h> struct node head=creat(head); print(head); } struct node*creat(structnode*head)函/数*返回的是与节点相同类型的指针*/ { struct node*p1,*p2; p1=p2=(structnode*)malloc(sizeof(structnode));申请 scanf("%d",&p1->num); p1->next=NULL; while(p1->num>0) { if(head==NULL)head=p1; elsep2->next=p1; p2=p1; p1=(structnode*)malloc(sizeof(structnode));申/请*下一个新节点*/ scanf("%d",&p1->num); } return head; } void print(struct node*head)输 { struct node *temp; temp=head; while(temp!=NULL) { printf("%6d",temp->num); temp=temp->next; } }