这篇“C++数据结构之双向链表怎么实现”文章的知识点大部分人都不太理解,所以小编给大家总结了以下内容,内容详细,步骤清晰,具有一定的借鉴价值,希望大家阅读完这篇文章能有所收获,下面我们一起来看看这篇“C++数据结构之双向链表怎么实现”文章吧。
#include <iostream>
using std::cout;
using std::endl;
struct Node
{
int data;
struct Node * next;
struct Node * pre;
};
Node * createList()
{
Node * head = new Node;
if (NULL == head)
exit(-1);
head->next = head;
head->pre = head;
return head;
}
让新来的节点先有所指
void insertList(Node * head,int n)
{
Node * cur = new Node;
if (NULL == cur)
exit(-1);
cur->next = head->next;
cur->pre = head;
head->next = cur;
cur->next->pre = cur;
cur->data = n;
}
int lenList(Node * head)
{
int i = 0;
Node * t = head->next;
while (t != head)
{
i++;
t = t->next;
}
return i;
}
Node * findList(Node * head,int fn)
{
Node * forward = head->next;
Node * back = head->pre;
while (forward != back->next)
{
if (forward->data == fn)
return forward;
if (back->data == fn)
return back;
if (forward == back)
break;
forward = forward->next;
back = back->pre;
}
return NULL;
}
void deleteList(Node * pFind)
{
pFind->pre->next = pFind->next;
pFind->next->pre = pFind->pre;
delete pFind;
}
(类似于先删除 再插入)
void sortDlist(Node * head)
{
int len = lenList(head);
Node *prep = NULL;
Node *p = NULL;
Node *q = NULL;
Node *t = NULL;
for (int i = 0;i < len - 1;i++)
{
p = head->next;
q = p->next;
for (int j = 0;j < len - 1 - i;j++)
{
if ((p->data)<(q->data))
{
p->pre->next = q;
q->pre = p->pre;
p->next = q->next;
p->pre = q;
q->next = p;
p->next->pre = p;
t = p;
p = q;
q = t;
}
p = p->next;
q = q->next;
}
}
}
void desList(Node * head)
{
head->pre->next = NULL;
Node *t = NULL;
while (head != NULL)
{
t = head;
head = head->next;
delete t;
}
}
以上就是关于“C++数据结构之双向链表怎么实现”这篇文章的内容,相信大家都有了一定的了解,希望小编分享的内容对大家有帮助,若想了解更多相关的知识内容,请关注亿速云行业资讯频道。
亿速云「云服务器」,即开即用、新一代英特尔至强铂金CPU、三副本存储NVMe SSD云盘,价格低至29元/月。点击查看>>
免责声明:本站发布的内容(图片、视频和文字)以原创、转载和分享为主,文章观点不代表本网站立场,如果涉及侵权请联系站长邮箱:is@yisu.com进行举报,并提供相关证据,一经查实,将立刻删除涉嫌侵权内容。