#include <stdio.h>
#include <stdlib.h>
typedef struct k{
int data;
struct k* next;
Node *h=(Node *)malloc(sizeof(Node));
h->next=NULL; return h;
}
void append(Node *h, int x){ /*尾插法追加*/
Node *p,*q;
for(p=h; p->next!=NULL; p=p->next);
q=(Node *)malloc(sizeof(Node));
q->data=x; q->next=NULL;
p->next=q;
#include <stdlib.h>
typedef struct k{
int data;
struct k* next;
}Node; /*创建链表*/
Node *h=(Node *)malloc(sizeof(Node));
h->next=NULL; return h;
}
void append(Node *h, int x){ /*尾插法追加*/
Node *p,*q;
for(p=h; p->next!=NULL; p=p->next);
q=(Node *)malloc(sizeof(Node));
q->data=x; q->next=NULL;
p->next=q;