不带头结点的单链表
难点:
1.二级指针,头指针在栈区,操作方法如果有可能修改头指针,则需要传递头指针的地址
2.插入和删除对于头插和尾删的特殊处理
声明单链表结点类型
typedef struct LNode
{
int data;//数据域
struct LNode* next;//指针域
}LNode,* Linklist
操作
链表初始化
void InitList(Linklist *plist)
{
assert(plist != NULL);
if(plist == NULL)return;
*plist = NULL;
}
为了实现以下插入,删除等一系列操作,先封装以下功能:
获取节点个数
int ListLength(Linklist plist)
{
int length = 0;
while(plist != NULL)
{
length++;
plist = plist->next;
}
return length;
}
根据位置找结点
//根据位置找结点
Linklist GetNode(Linklist plist,int pos)
{
while(pos>1)
{
pos--;
plist = plist->next;
}
return plist;
}
申请节点
static Linklist _ApplyNode(int val,Linklist next)
{
Linklist s = (Linklist)malloc(sizeof(LNode));
assert(s != NULL);
if (s == NULL)
{
printf("Insert Fail : Apply Spave Error\n");
return NULL;
}
s->data = val;
s->next = next;
return s;
}
插入
void Insert(Linklist *plist, int val, int pos)
{
assert(plist != NULL);
if(plist == NULL)return;
if(pos < 0 || pos >ListLength(*plist))
{
return;
}
if(pos == 0)
{
*plist = _ApplyNode(val , *plist);
return;
}
Linklist p = GetNode(*plist,pos);
//在p的后面插入节点
p->next = _ApplyNode(val , p->next);
}
头插
void Insert_Head(Linklist *plist, int val)
{
assert(plist != NULL);
if(plist == NULL)return;
*plist = _ApplyNode(val , *plist);
}
尾插
void Insert_Tail(Linklist *plist, int val)
{
assert(plist != NULL);
if(plist == NULL)return;
Insert(plist, val, ListLength(*plist));
}
删除
void Delete(Linklist *plist,int pos)
{
assert(plist != NULL);
if(plist == NULL)return;
if(pos <= 0 || pos > ListLength(*plist))
{
return;
}
//第一个节点特殊处理
if(pos = 1)
{
Linklist q = *plist;
*plist = q->next;//头指针指向第二个节点
free(q);
return;
}
Linklist p =GetNode(*plist,pos-1);
Linklist q = p->next;
p->next = q ->next;
free(q);
}
头删
//头删
void Delete_Head(Linklist *plist)
{
assert(plist != NULL);
if(plist == NULL)return;
if(ListEmpty(*plist))
{
return;
}
Delete(plist,1);
}
尾删
//尾插
void Delete_Tail(Linklist *plist)
{
assert(plist != NULL);
if(plist == NULL)return;
Delete(plist,ListLength(*plist));
}
判空
int ListEmpty(Linklist plist)
{
if(plist == NULL) return 1;
return 0;
}
置空
void Clear(Linklist *plist)
{
assert(plist != NULL);
if(plist == NULL)return;
while( !ListEmpty(*plist) )
{
Delete_Head(plist);
}
}
显示
//显示
void Show(Linklist plist)
{
while(plist != NULL)
{
printf("%d ——> ",plist->data);
plist = plist->next;
}
printf("NULL\n");
}
头文件
//对于单链表节点类型的声明
typedef struct LNode
{
int data;
struct LNode* next;
}LNode;
typedef struct LNode* Linklist;
//链表初始化
void InitList(Linklist *plist);
//插入
void Insert(Linklist *plist, int val, int pos);
//获取结点个数
int ListLength(Linklist plist);
//根据位置找结点
Linklist GetNode(Linklist plist,int pos);
//头插
void Insert_Head(Linklist *plist, int val);
//尾插
void Insert_Tail(Linklist *plist, int val);
//删除
void Delete(Linklist *plist,int pos);
//头删
void Delete_Head(Linklist *plist);
//尾插
void Delete_Tail(Linklist *plist);
//判空
int ListEmpty(Linklist plist);
//置空
void Clear(Linklist *plist);
//显示
void Show(Linklist plist);
功能实现
#include"noheadlist.h"
#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
//链表初始化
void InitList(Linklist *plist)
{
assert(plist != NULL);
if(plist == NULL)return;
*plist = NULL;
}
//获取结点个数
int ListLength(Linklist plist)
{
int length = 0;
while(plist != NULL)
{
length++;
plist = plist->next;
}
return length;
}
static Linklist _ApplyNode(int val,Linklist next)
{
Linklist s = (Linklist)malloc(sizeof(LNode));
assert(s != NULL);
if (s == NULL)
{
printf("Insert Fail : Apply Spave Error\n");
return NULL;
}
s->data = val;
s->next = next;
return s;
}
//根据位置找结点
Linklist GetNode(Linklist plist,int pos)
{
while(pos>1)
{
pos--;
plist = plist->next;
}
return plist;
}
//插入
void Insert(Linklist *plist, int val, int pos)
{
assert(plist != NULL);
if(plist == NULL)return;
if(pos < 0 || pos >ListLength(*plist))
{
return;
}
if(pos == 0)
{
*plist = _ApplyNode(val , *plist);
return;
}
Linklist p = GetNode(*plist,pos);
//在p的后面插入节点
p->next = _ApplyNode(val , p->next);
}
//头插
void Insert_Head(Linklist *plist, int val)
{
assert(plist != NULL);
if(plist == NULL)return;
*plist = _ApplyNode(val , *plist);
}
//尾插
void Insert_Tail(Linklist *plist, int val)
{
assert(plist != NULL);
if(plist == NULL)return;
Insert(plist, val, ListLength(*plist));
}
//删除
void Delete(Linklist *plist,int pos)
{
assert(plist != NULL);
if(plist == NULL)return;
if(pos <= 0 || pos > ListLength(*plist))
{
return;
}
//第一个节点特殊处理
if(pos = 1)
{
Linklist q = *plist;
*plist = q->next;//头指针指向第二个节点
free(q);
return;
}
Linklist p =GetNode(*plist,pos-1);
Linklist q = p->next;
p->next = q ->next;
free(q);
}
//判空
int ListEmpty(Linklist plist)
{
if(plist == NULL) return 1;
return 0;
}
//头删
void Delete_Head(Linklist *plist)
{
assert(plist != NULL);
if(plist == NULL)return;
if(ListEmpty(*plist))
{
return;
}
Delete(plist,1);
}
//尾删
void Delete_Tail(Linklist *plist)
{
assert(plist != NULL);
if(plist == NULL)return;
Delete(plist,ListLength(*plist));
}
//置空
void Clear(Linklist *plist)
{
assert(plist != NULL);
if(plist == NULL)return;
while( !ListEmpty(*plist) )
{
Delete_Head(plist);
}
}
//显示
void Show(Linklist plist)
{
while(plist != NULL)
{
printf("%d ——> ",plist->data);
plist = plist->next;
}
printf("NULL\n");
}
测试用例
#include<stdio.h>
#include"noheadlist.h"
#include<assert.h>
#include<stdlib.h>
int main()
{
Linklist plist;//栈区定义的结点指针
InitList(&plist);
Insert_Tail(&plist,10);
Insert_Tail(&plist,20);
Insert_Tail(&plist,30);
Insert_Tail(&plist,40);
Show(plist);
Delete(&plist,1);
Show(plist);
Clear(&plist);
Show(plist);
return 0;
}