#include #include //定义链表 typedef struct node { int data; struct node * next; }NODE; NODE *head,*tail; //链表初始化 void Init() { head = NULL; tail = NULL; } //输入元素 void CreateList(int n) { NODE *tmp; int i,num; scanf("%d",&num); head = (NODE*)malloc(sizeof(NODE)); if(head == NULL) { return ; } head->data = num; head->next = NULL; tail = head; for(i=0; idata = num; tmp->next = NULL; tail->next = tmp; tail = tmp; } } /*插入元素*/ void Insert(int n) { NODE *tmp; tmp = (NODE*)malloc(sizeof(NODE)); if(tmp == NULL) { return ; } tmp->data = n; tmp->next = NULL; tail->next = tmp; tail = tmp; } //输出链表 void PrintList() { NODE *curNode = head; while(curNode != NULL) { printf("%d\t",curNode->data);
