一、单链表的整表创建
#define OK 1
#define ERROR 0
typedef int ElemType;
typedef struct Node{
ElemType data;
struct Node *next;
}Node;
typedef struct Node *LinkList;
(1)头插法
void CreatListHead(LinkList *L, int n)
{
int i;
LinkList p;
srand(time(0));
*L = (LinkList)malloc(sizeof(Node));
for(i = 1; i < n; i++)
{
p = (LinkList)malloc(sizeof(Node));
p->data = rand()%100+1;
p->next = (*L)->next;
(*L)->next = p;
}
}
(2)尾插法
void CreatListTail(LinkList *L, int n)
{
int i;
LinkList p,r;
srand(time(0));
*L = (LinkList)malloc(sizeof(Node));
r = *L;
for(i = 1; i<n; i++)
{
p = (LinkList)malloc(sizeof(Node));
p->data = rand()%100 +1;
r->next = p;
r =p;
}
r->next = NULL;
}
二、单链表的整表删除