双向链表
typedef struct node
{
int data;
struct node *next;
struct node *prev;
}
在双向链表末尾添加一个值
node* push_back(node *last,int info)
{//如果是双向链表的第一个结点
if(last==NULL)
{
last = (node *)malloc(sizeof(node));
last->data = info;
last->next = NULL;
last->prev = NULL;
return last;
}
else
{
node *p = (node *)malloc(sizeof(node));
if(p)
{
last->next = p;
p->data = info;
p->next = NULL;
p->prev = last;
}
return p;
}
}
如何在双向链表前部添加一个数值
node* push_front(node *h,int info)
{
node *p = (node *)malloc(sizeof(node));
p->prev = NULL;
p->next = h;
h->prev = p;
p->data = info;
return p;
}
如何前进到双向链表的下一个结点
node* Next(node *ANode)
{
return ANode->next;
}
如何前进到双向链表的前一个结点
node* Prev(node *ANode)
{
return ANode->prev;
}
顺序展示双向链表
void display_forward(node *head)
{
node *p = head;
for( ;p!=NULL;p=p->next)
printf("Value: %d Address: %u\n",p->data,p);
}
倒序展示双向链表
void display_backward(node *tail)
{
node *p = tail;
for( ;p!=NULL;p=p->prev)
printf("Value: %d Address: %u\n",p->data,p);
}
在链表的某个位置后插入一个值,index从0开始
node* insert_at(node *head,int index,int value)
{
node *n = head;
int i = 0;
for( ;head!=NULL;head=head->next)
{
i++;
if(i==index)
{
node *p = (node *)malloc(sizeof(node));
p->next = head->next;
head->next->prev = p;
p->prev = head;
head->next = p;
p->data = value;
}
}
return n;
}
在循环双向链表末尾添加一个值
node* push_back(node *last,int info)
{
if(last==NULL)
{
last = (node *)malloc(sizeof(node));
last->data = info;
last->next = NULL;
last->prev = NULL;
return last;
}
else
{
node *p = (node *)malloc(sizeof(node));
if(p)
{
last->next = p;
p->data = info;
p->prev = last;
//FirstNode全局变量,指向链表头结点,在链表前部添加结点时被更新
p->next = FirstNode;
return p;
}
}
}