1.链表的分类
链表一共有三种属性:
1.单向或者双向
2.带头或者不带头
这里的带头即为带哨兵位
哨兵位即为head;
3.循环或者不循环
链表的种类
1.单向带头循环链表
2.单向带头非循环
3.单向不带头循环
4.单向不带头非循环
5.双向带头循环
6.双向带头非循环
7.双向不带头循环
8.双向不带头非循环
2.常用的链表结构
1.无头单向非循环链表
无头单向非循环链表:结构简单,一般不会单独用来存数据。实际中更多是作为其他数据结构的子结构,如哈希桶、图的邻接表等等。另外这种结构在笔试面试中出现很多。多用于oj题目;
2.带头双向循环链表
特点:带头双向循环链表:结构最复杂,一般用在单独存储数据。实际中使用的链表数据结构,都是带头双向循环链表。另外这个结构虽然结构复杂,但是使用代码实现以后会发现结构会带来很多优势,实现反而简单了,后面我们代码实现了就知道了。
3.双向链表的实现
//创建新节点
LTNode* BuyLTNode(LTDateType x)
{
LTNode* newnode = (LTNode *) malloc(sizeof(LTNode));//这里忘记malloc的判断了
if (newnode == NULL)
{
perror("malloc fail");
}
newnode->prev = NULL;
newnode->next = NULL;
newnode->date = x;
return newnode;
}
//双链表的初始化
//这里初始化的是哨兵位;注意哨兵位需要内部不要添加内容;
LTNode* LTInit()
{
LTNode* phead = BuyLTNode(-1);
phead->next = phead;//后指针
phead->prev = phead;//前指针
}
//双链表的尾插
void LTPushback(LTNode* phead, LTDateType x)
{
/*LTNode* tail = phead->prev;
LTNode* newnode=BuyLTNode(x);
tail->next = newnode;
newnode->prev = tail;
phead->prev = newnode;
newnode->next = phead;*/
LTInsert(phead, x);
}
//双链表的头插
void LTPushFront(LTNode* phead, LTDateType x)
{
/*LTNode* next = phead->next;
LTNode* newnode = BuyLTNode(x);
newnode->next = next;
next->prev = newnode;
phead->next = newnode;
newnode->prev = phead;*/
LTInsert(phead->next, x);
}
//双链表的尾删
void LTPopback(LTNode* phead)
{
//assert(phaed);
//assert(LTEmpty(phead));
/*LTNode* tail = phead->prev;
LTNode* ptail = tail->prev;
free(tail);
phead->prev = ptail;
ptail->next = phead;*/
LTErase(phead->prev);
}
//双链表的头删
void LTPopFront(LTNode* phead)
{
/*LTNode* pnext = phead->next;
phead->next = pnext->next;
pnext->next->prev = phead;
free(pnext);*/
LTErase(phead->next);
}
//链表的打印;
void LTPrint(LTNode* phead)
{
assert(phead);
printf("guard<==>");
LTNode* cur = phead->next;
while (cur!=phead)
{
printf("%d ", cur->date);
cur = cur->next;
}
printf("\n");
}
//链表寻找
LTNode* LTFind(LTNode* phead, LTDateType x)
{
assert(phead);
LTNode* cur = phead->next;
while (cur!=phead)
{
if (cur->date == x)
return cur;
cur=cur->next;
}
return NULL;
}
//在pos之前插入
void LTInsert(LTNode* pos, LTDateType x)
{
LTNode* prev = pos->prev;
LTNode* newnode = BuyLTNode(x);
prev->next = newnode;
newnode->prev = prev;
newnode->next = pos;
pos->prev = newnode;
}
//删除pos位置的值
void LTErase(LTNode* pos)
{
LTNode* prev = pos->prev;
LTNode* next = pos->next;
free(pos);
prev->next = next;
next->prev = prev;
}
//链表清理
void LTDestroy(LTNode* phead)
{
LTNode* cur = phead->next;
while (cur!=phead)
{
LTNode* n = cur;
free(n);
cur = cur->next;
}
free(phead);
}
//判断链表是否为空
bool LTEmpty(LTNode* phead)
{
assert(phead);
return phead->next == phead;
}