数据结构学习第六课（循环链表）

3，循环链表

3.1创建一个循环链表

DuList* createDuList()
{
	DuList* list = calloc(1, sizeof(DuList));
	assert(list != NULL);
	//创建头结点
	list->front = calloc(1, sizeof(Node));
	assert(list->front != NULL);
	list->tail = list->front;//让头指针和尾指针都指向头结点
	
	list->front->prev = list->front;
	list->tail->next = list->front;

	return list;
}

3.2尾插

//尾插
void push_back(DuList* list, Data data)
{
	Node* newNode = createNode(data);
	newNode->next = list->tail->next;//新结点的后继指针指向NULL
	newNode->prev = list->tail;//新结点的前驱指针指向原先的最后一个
	list->tail->next = newNode;//让原先的尾结点指向新结点
	list->tail = newNode;//让尾指针指向新结点
	list->front->prev = newNode;//让头结点的前驱指针指向新尾结点
	list->size++;
}

3.3输出

//输出
void show_list(DuList* list)
{
	if (empty(list))
	{
		return;
	}
#if 0//正向输出
	Node* curNode = list->front->next;
	while (curNode!=list->front)
	{
		printf("%d ", curNode->data);
		curNode = curNode->next;
	}
#else//反向输出
	Node* curNode = list->tail;
	while (curNode != list->front)
	{
		printf("%d ", curNode->data);
		curNode = curNode->prev;
	}
#endif
	printf("\n");
}

3.4查找指定元素

//查找指定元素，找到返回结点所在的位置，没有则放回NULL
Node* find(DuList* list, Data data)
{
	if (empty(list))
	{
		return NULL;
	}
	Node* curNode = list->front->next;
	while (curNode!= list->front)
	{
		if (curNode->data==data)
		{
			return curNode;
		}
		curNode = curNode->next;
	}
	return list->front;
}

3.5尾部删除

//尾部删除
void pop_back(DuList* list)
{
	if (empty(list))
	{
		return;
	}
	list->tail = list->tail->prev;//让尾指针前移一位
	free(list->tail->next);
	list->tail->next = list->front;
	list->size--;
}

3.6排序

//排序
void sort(DuList* list)
{
	if (empty(list))
	{
		return;
	}
	for (Node* i = list->front->next; i->next!= list->front; i=i->next)
	{
		for (Node* k = list->front->next; k->next != list->front; k = k->next)
		{
			if (k->data>k->next->data)
			{
				Data t = k->data;
				k->data = k->next->data;
				k->next->data = t;
			}
		}
	}
}

3.7清除

//清除
void clear(DuList* list)
{
	if (empty(list))
	{
		return;
	}
	while (list->front->next!= list->front)
	{
		pop_front(list);
	}
	list->size = 0;
}

3.8反转

//反转
void reverse(DuList* list)
{
	if (size(list) <= 1)
	{
		return;
	}
	Node* curNode = list->front->next;
	Node* prevNode = list->front;
	Node* nextNode = list->front;
	list->tail = curNode;
	while (curNode!= list->front)
	{
		nextNode = curNode->next;
		curNode->next = prevNode;
		curNode->prev = nextNode;
		prevNode = curNode;
		curNode = nextNode;//移动当前指针
	}
	list->front->next = prevNode;
	prevNode->prev = list->front;
}