带头节点的单链表:
typedef int ELEM_TYPE;
typedef struct Node
{
ELEM_TYPE mdata;
struct Node* pnext;
}Node, *Link;void Init(Link phead);
static Link BuyNode();
bool InsertTail(Link phead, ELEM_TYPE val);
bool InsertHead(Link phead, ELEM_TYPE val);
bool DeleteKey(Link phead, ELEM_TYPE val);
void Print(Link phead);
void Clear(Link phead);
void Destory(Link phead);
void Reverse(Link phead);
//链表初始化
void Init(Link phead)
{
assert(phead != NULL);
if (phead == NULL)
{
return;
}
phead->pnext = NULL;
}
//创建一个新的节点
static Link BuyNode()
{
struct Node* pnewnode = (struct Node*)malloc(sizeof(struct Node));
assert(pnewnode != NULL);
pnewnode->pnext = NULL;
return pnewnode;
}
//尾插
bool InsertTail(Link phead, ELEM_TYPE val)
{
if (phead == NULL)
{
return false;
}
struct Node* pCur = phead;
while (pCur->pnext != NULL)
{
pCur = pCur->pnext;
}
struct Node* pnewnode = BuyNode();
pnewnode->mdata = val;
pCur->pnext = pnewnode;
return true;
}
//头插
bool InsertHead(Link phead, ELEM_TYPE val)
{
if (phead == NULL)
{
return false;
}
struct Node* pnewnode = BuyNode();
pnewnode->mdata = val;pnewnode->pnext = phead->pnext;
phead->pnext = pnewnode;
return true;
}
//删除链表中的某个元素
bool DeleteKey(Link phead, ELEM_TYPE val)
{
if (phead == NULL)
{
return false;
}
Node* pfront = phead;
while (pfront->pnext != NULL)
{
if (pfront->pnext->mdata == val)
{
break;
}
pfront = pfront->pnext;
}
if (pfront->pnext == NULL)
{
return false;
}
Node* pCur = pfront->pnext;
pfront->pnext = pCur->pnext;free(pCur);
return true;
}
//打印元素
void Print(Link phead)
{
if (phead == NULL)
{
return;
}
struct Node* pCur = phead->pnext;
while (pCur != NULL)
{
printf("%d ", pCur->mdata);
pCur = pCur->pnext;
}
printf("\n");
}
//清理数据结点
void Clear(Link phead)
{
struct Node* pCur = phead->pnext; //pCur 当前要删除的结点
struct Node* pNext = pCur;
while (pCur != NULL)
{
pNext = pCur->pnext;
free(pCur);
pCur = pNext;
}
phead->pnext = NULL;
}
void Destory(Link phead)
{
Clear(phead);
}
链表_单链表_带头节点的单链表
最新推荐文章于 2021-11-02 21:37:11 发布