7.6 双向循环链表

7.6 双向循环链表

代码

/*************************************
*	名称描述：双向循环链表 
*	实现功能：双向链表的添加、删除、遍历 
*	作    者：王 利 涛
*   QQ   群 ：475504428
*   公 众 号：宅学部落(armlinuxfun)
*   嵌入式自学路线咨询 QQ：3284757626 
*************************************/ 
#include<stdio.h>
#include<stdlib.h>

struct list_node{
	int data;
	struct list_node *next;
	struct list_node *prev;
};

int is_list_empty(struct list_node *head)
{
	return (head->next == head || head->prev == head);
}

void list_print(struct list_node *head)
{
	if(head->next == head || head->prev == head)
		printf("list_print:empty list!\n");
	else
	{
		struct list_node *p;
		p = head->next;
		for(p;p!=head;p=p->next)
			printf("p->data = %d\n",p->data);		
	 
	}
}
void list_free(struct list_node *head)
{
	struct list_node *p,*q;
	if(head->next != head)
	{
		q = head->next;
		if(q->next == head)
			free(q);
		else
		{
			p = q->next;
			while(q!=head)
			{
				free(q);
				q = p;
				if(p!=head)
					p = p->next;
				printf("p:%p q:%p\n",p,q);		
			};
		}
	}
	free(head);
}

void list_add(struct list_node *head,struct list_node *node)
{
	 	node->next = head->next;
	 	head->next = node;	 	 
		node->next->prev = node;
		node->prev = head;	
}

void list_add_tail(struct list_node *head,struct list_node *node)
{
	struct list_node *p;
 	if(head->next == head)
 	{
		head->next = node;
		node->prev = head; 	 	
 	 	head->prev = node;
	 	node->prev = head;
 	}
 	else
 	{
		p = head->prev;
 		p->next = node;
 		node->next = head;	
 		node->prev = p;
		head->prev = node; 	 	
    }	
}
void list_delete(struct list_node *head)
{
	struct list_node *p;
	if(head->next == head)
	{
		printf("list_delete:empty list!\n");
	}
	else
	{
		p = head->next; 
		head->next = p->next;
		p->next->prev = p->prev;
		free(p);
	}
}

void list_delete_tail(struct list_node *head)
{
	struct list_node *p;
	if(head->next == head)
	{
		printf("list_delete_list:empty list!\n");
	}
	else
	{
		p = head->prev;	
		p->prev->next = p->next;
		head->prev = p->prev;		
		free(p);		
	}
}

int list_delete_by_id(struct list_node *head,struct list_node *node)
{
	struct list_node *p; 
	
	if(head->next == head)
		printf("list_delete_by_id:empty list!\n");
	else
	{
		p = head->next;
		for(p;p!=head;p=p->next)
		{
			if(p == node)
				break;	
		}
		if(p==head)
		{
			printf("list_delete_by_id:find no node!\n");
			return -1;
		}
		p->prev->next = p->next;
		p->next->prev = p->prev;
		free(p);
	}

	return 0;	
}

struct list_node *list_foreach(struct list_node *head,int val)
{
	struct list_node *p;
	p = head->next;
	for(p;p->data!=val;p=p->next);
	return p;
} 

int main(void)
{
	struct list_node *p,*head;
	head = (struct list_node*)malloc( sizeof(struct list_node));
	head->data = 0;
	head->next = head;
	head->prev = head;
	
	p = (struct list_node*)malloc( sizeof(struct list_node));
	p->data = 1;
	p->next = NULL;
	p->prev = NULL;
	list_add_tail(head,p);
	
	p = (struct list_node*)malloc( sizeof(struct list_node));
	p->data = 2;
	p->next = NULL;
	p->prev = NULL;
	list_add_tail(head,p);	
	
	p = (struct list_node*)malloc( sizeof(struct list_node));
	p->data = 3;
	p->next = NULL;
	p->prev = NULL;
	list_add_tail(head,p);	

	p = (struct list_node*)malloc( sizeof(struct list_node));
	p->data = 4;
	p->next = NULL;
	p->prev = NULL;
	list_add_tail(head,p);
	
//	list_delete_by_id(head,head->next);		
//	list_print(head);
	
//	list_delete_(head);
	list_print(head);
	list_delete_tail(head);
	list_print(head);
	list_delete_tail(head);
	list_print(head);
	list_delete_tail(head);	
	list_print(head);
	list_delete_tail(head);
	list_delete_tail(head);

	list_print(head);
	list_delete_tail(head);
	list_print(head);
//	p = list_foreach(head,2);
//	printf("%d\n",p->data);	
 

//	list_free(head);
	return 0;
}