数据结构4-CSDN博客

本文链接：https://blog.csdn.net/weixin_57167884/article/details/123011741

双向循环链表

1.结构体类型

typedef struct node
{
	int num;
	struct node *prev;
	struct node *next;
}Dnode;

typedef Dnode * Dlink;

2.创建结点

int is_malloc_ok(Dlink new_node)
{
	if(NULL == new_node)
	{
		printf("malloc fail\n");
	}

	else
	{
		return MALLOC_OK;
	}
}

int create_new_node(Dlink *new_node)
{
	*new_node = (Dlink)malloc(sizeof(Dnode));

	if(MALLOC_OK == is_malloc_ok(*new_node))
	{
		return CREATE_OK;
	}
	else
	{
		return CREATE_NO;
	}
}

3.创建链表

void create_dlink(Dlink *head)
{
	if(CREATE_OK == create_new_node(head))
	{
		(*head)->next = *head;
		(*head)->prev = *head;
	}
	else
	{
		return;
	}
}

4.头插

void insert_node_head(Dlink head,Dlink new_node)
{
	new_node->next = head->next;
	new_node->prev = head;
	head->next = new_node;
	new_node->next->prev = new_node;
}

5.尾插

void insert_node_tail(Dlink head,Dlink new_node)
{
	Dlink p = NULL;
	p = head;
	while(p->next != head)
	{
		p = p->next;
	}
	head->prev = new_node;
	new_node->next = head;
	p->next = new_node;
	new_node->prev = p;
}

6.中间前插

void insert_node_mid_before(Dlink head,Dlink new_node,int num)
{
	Dlink p,q = NULL;
	q = head;
	p = head->next;
	while(p != head && p->num != num)
	{
		q = p;
		p = p->next;
	}
	q->next = new_node;
	new_node->prev = q;
	new_node->next = p;
	p->prev = new_node;
}//语句顺序不能乱

7.中间后插

void insert_node_mid_after(Dlink head,Dlink new_node,int num)
{
	Dlink p = NULL;
	p = head->next;
	while(p != head && p->num != num)
	{
		p = p->next;
	}
	new_node->next = p->next;
	p->next->prev = new_node;
	p->next = new_node;
	new_node->prev = p;
}

8.直插排序

void insert_node_sort(Dlink head,Dlink new_node)
{
	Dlink p,q = NULL;
	q = head;
	p = head->next;
	while(p != head && p->num < new_node->num)
	{
		q = p;
		p = p->next;
	}
	q->next = new_node;
	new_node->prev = q;
	new_node->next = p;
	p->prev = new_node;

}

9.正序遍历

void display_dlink(Dlink head)
{
	Dlink p = NULL;
	p = head->next;
	while(p != head)
	{
		printf("%d ",p->num);
		p = p->next;
	}
}//正序遍历

10.逆序遍历

void res_display_dlink(Dlink head)
{
	Dlink p = NULL;
	p = head->prev;
	while(p != head)
	{
		printf("%d ",p->num);
		p = p->prev;
	}
}//逆序遍历

11.清空

void make_empty(Dlink head)
{
	Dlink p = NULL;
	p = head->next;
	while(p != head)
	{
		head->next = p->next;
		free(p);
		p = head->next;
	}
}

12.释放

void release_dlink(Dlink *head)
{
	make_empty(*head);
	free(*head);
    *head = NULL;
}

13.查找数据

Dlink find_node(Dlink head,int num)
{
	Dlink p = NULL;
	p = head->next;
	while(p != head && p->num != num)
	{
		p = p->next;
	}

	if(p == head)
	{
		return NULL;
	}
	else
	{
		return p;
	}
}

14.删除数据

void delete_node(Dlink head,int num)
{
	
	Dlink p,q = NULL;
	q = head;
	p = head->next;
	while(p != head && p->num != num)
	{
		q = p;
		p = p->next;
	}

	if(NULL == p)
	{
		printf("no such node!\n");
	}

	else
	{
		q->next = p->next;
		free(p);
	}
}

15.计算链表长度

int Length_dlink(Dlink head)
{
	Dlink p = NULL;
	p = head->next;
	int count = 0;

	while(p != head)
	{
		p = p->next;
		count++;
	}
	return count;
}

完整代码

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

#define MALLOC_OK 1
#define MALLOC_NO 0
#define CREATE_OK 1
#define CREATE_NO 0

typedef struct node
{
	int num;
	struct node *prev;
	struct node *next;
}Dnode;

typedef Dnode * Dlink;

int is_malloc_ok(Dlink new_node)
{
	if(NULL == new_node)
	{
		printf("malloc fail\n");
	}

	else
	{
		return MALLOC_OK;
	}
}

int create_new_node(Dlink *new_node)
{
	*new_node = (Dlink)malloc(sizeof(Dnode));

	if(MALLOC_OK == is_malloc_ok(*new_node))
	{
		return CREATE_OK;
	}
	else
	{
		return CREATE_NO;
	}
}

void create_dlink(Dlink *head)
{
	if(CREATE_OK == create_new_node(head))
	{
		(*head)->next = *head;
		(*head)->prev = *head;
	}
	else
	{
		return;
	}
}

void insert_node_head(Dlink head,Dlink new_node)
{
	new_node->next = head->next;
	new_node->prev = head;
	head->next = new_node;
	new_node->next->prev = new_node;
}

void insert_node_tail(Dlink head,Dlink new_node)
{
	Dlink p = NULL;
	p = head;
	while(p->next != head)
	{
		p = p->next;
	}
	head->prev = new_node;
	new_node->next = head;
	p->next = new_node;
	new_node->prev = p;
}

void insert_node_mid_before(Dlink head,Dlink new_node,int num)
{
	Dlink p,q = NULL;
	q = head;
	p = head->next;
	while(p != head && p->num != num)
	{
		q = p;
		p = p->next;
	}
	q->next = new_node;
	new_node->prev = q;
	new_node->next = p;
	p->prev = new_node;
}

void insert_node_mid_after(Dlink head,Dlink new_node,int num)
{
	Dlink p = NULL;
	p = head->next;
	while(p != head && p->num != num)
	{
		p = p->next;
	}
	new_node->next = p->next;
	p->next->prev = new_node;
	p->next = new_node;
	new_node->prev = p;
}
void res_display_dlink(Dlink head)
{
	Dlink p = NULL;
	p = head->prev;
	while(p != head)
	{
		printf("%d ",p->num);
		p = p->prev;
	}
}//逆序遍历
void display_dlink(Dlink head)
{
	Dlink p = NULL;
	p = head->next;
	while(p != head)
	{
		printf("%d ",p->num);
		p = p->next;
	}
}//正序遍历

void make_empty(Dlink head)
{
	Dlink p = NULL;
	p = head->next;
	while(p != head)
	{
		head->next = p->next;
		free(p);
		p = head->next;
	}
}

void release_dlink(Dlink *head)
{
	make_empty(*head);
	free(*head);
}

void insert_node_sort(Dlink head,Dlink new_node)
{
	Dlink p,q = NULL;
	q = head;
	p = head->next;
	while(p != head && p->num < new_node->num)
	{
		q = p;
		p = p->next;
	}
	q->next = new_node;
	new_node->prev = q;
	new_node->next = p;
	p->prev = new_node;

}

Dlink find_node(Dlink head,int num)
{
	Dlink p = NULL;
	p = head->next;
	while(p != head && p->num != num)
	{
		p = p->next;
	}

	if(p == head)
	{
		return NULL;
	}
	else
	{
		return p;
	}
}

void delete_node(Dlink head,int num)
{
	
	Dlink p,q = NULL;
	q = head;
	p = head->next;
	while(p != head && p->num != num)
	{
		q = p;
		p = p->next;
	}

	if(NULL == p)
	{
		printf("no such node!\n");
	}

	else
	{
		q->next = p->next;
		free(p);
	}
}

int Length_dlink(Dlink head)
{
	Dlink p = NULL;
	p = head->next;
	int count = 0;

	while(p != head)
	{
		p = p->next;
		count++;
	}
	return count;
}

int main(int argc, const char *argv[])
{
	Dlink head = NULL;
	Dlink new_node = NULL;
	Dlink p = NULL;
	int i;
	int num1,num2;

	srand((unsigned)time(NULL));
	
	create_dlink(&head);

	for(i = 0; i < 10; i++)
	{
		if(CREATE_OK == create_new_node(&new_node))
		{
			new_node->num = rand() % 100;

		//	new_node->num = i + 1;
			
		//	insert_node_head(head,new_node);
		//	insert_node_tail(head,new_node);
			insert_node_sort(head,new_node);
		}
	}

	display_dlink(head);

	printf("\n");

//	printf("Length = %d",Length_dlink(head));

//	printf("\n");
	
	printf("input you want to find num:");
//	printf("input you want to delete num:");
	scanf("%d",&num2);
//	delete_node(head,num2);
//	display_dlink(head);
	
	p = find_node(head,num2);
	if(p != NULL)
	{
		printf("%p\n",p);
		printf("%d",p->num);
	}
	else
	{
		printf("no such num\n");
	}


	printf("\n");

//	make_empty(head);

	release_dlink(&head);

#if 0
	printf("input loc:");
	scanf("%d",&num1);

	if(CREATE_OK == create_new_node(&new_node))
	{
		printf("input num:");
		scanf("%d",&new_node->num);
	//  insert_node_mid_before(head,new_node,num1);
		insert_node_mid_after(head,new_node,num1);
	}
#endif

	display_dlink(head);

	printf("\n");

	return 0;
}