list.h
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
//#include <vld.h>
//千万不要使用头结点进行查找或比较等
typedef struct CNode
{
int data;
struct CNode *next;
}CNode,*CList;
void InitCList(CList plist);
void Insert_Chead(CList plist,int val);
void Insert_Ctail(CList plist,int val);
bool Delete(CList plist,int key);
void ShowC(CList plist);
int Getlength(CList plist);
CNode * Search(CList plist,int key);
void Destroy(CList plist);
list.cpp
#include "list.h"
//需要前驱时,p=plist,p->next!=NULL,p=p->next;
//不需要前驱时,p=plist->next;p!=NULL;p=p->next;
//初始化链表
void InitList(List plist)
{
assert(plist!=NULL);
plist->next=NULL;
}
//申请一个结点
static Node * BuyNode(int val)
{
Node *p=(Node *)malloc(sizeof(Node));
assert(p!=NULL);
p->data=val;
p->next=NULL;
return p;
}
//头插法
void Insert_head(List plist,int val)
{
Node *p=BuyNode(val);
p->next=plist->next;
plist->next=p;
}
//尾插法,比较符合人类习惯
void Insert_tail(List plist,int val)
{
Node *p=BuyNode(val);
//Node *p1;
//p1=plist;
while(plist!=NULL)
{
if(plist->next!=NULL)
{
plist=plist->next;
}
else
{
break;
}
}
plist->next=p;
}
//打印
void Show(List plist)
{
Node *p;
for(p=plist->next;p!=NULL;p=p->next)
{
printf("%d ",p->data);
}
printf("\n");
}
//统计链表结点个数
int Getlength(List plist)
{
Node *p;
int i=0;
for(p=plist->next;p!=NULL;p=p->next)
{
i++;
}
return i;
}
//查找与key值相同的第一个结点
Node *Search(List plist,int key)
{
Node *p;
for(p=plist->next;p!=NULL;p=p->next)
{
if(p->data==key)
{
printf("key=%d\n",p->data);
return p;
}
}
printf("未找到\n");
return NULL;
}
//删除与key相同的第一个元素
bool Delete(List plist,int key)
{
Node *p;
Node *q;
for(p=plist->next;p!=NULL;p=p->next)
{
if(p->data==key)
{
q->next=p->next;
free(p);
return true;
}
q=p;
}
return false;
}
//销毁
void Destroy(List plist)
{
Node *p;
Node *q;
for(p=plist->next;p!=NULL;p=p->next)
{
q=p;
free(q);
}
}
test.cpp#include "list.h"
int main()
{
Node head;
InitList(&head);
//Node *plist;//野指针,未指向一个有效地址
//InitList(plist);
for(int i=0;i<10;i++)
{
Insert_tail(&head,i);
}
Destroy(&head);
//Show(&head);
}