数据结构循环单链表之(一)初始化&&尾插&&头插&&显示表&&尾删&&头删

前言

开始循环单链表！！！功能和单链表一样，这一部分包括初始化&&尾插&&头插&&显示表&&尾删&&头删

1. 思路

1.1 初始化

1.2 尾插

1.3 显示表

1.4 头插

1.5 尾删

1.6 头删

2. 代码

2.1 SCList.h

#ifndef _SCList_H_
#define _SCList_H_

#include <stdio.h>
#include <assert.h>
#include <malloc.h>

typedef int ElemType;

typedef struct Node
{
	ElemType data;
	struct Node *next;
}Node, *PNode;

typedef struct List
{
	PNode first;
	PNode last;
	int size;
}List;

//初始化
void InitSCList(List *list);

//显示链表
void show(List *list);

//尾插
void push_back(List *list, ElemType x);

//头插
void push_front(List *list, ElemType x);

//尾删
void pop_back(List *list);

//头删
void pop_front(List *list);

#endif //_SCList_H_

2.2 SCList.cpp

#include "SCList.h"

void InitSCList(List *list)
{
	Node *s   = (Node *)malloc(sizeof(Node));
	assert(s != NULL);
	list->first      = list->last = s;
	list->last->next = list->first;
	list->size       = 0;
}

void show(List *list)
{
	Node *s = list->first->next;
	while(s != list->first)
	{
		printf("%d-->", s->data);
		s = s->next;	
	}
	printf("NUL.\n");
}

Node* buy_node(ElemType x)
{
	Node *s = (Node *)malloc(sizeof(Node));
	assert(s != NULL);
	s->data = x;
	s->next = NULL;
	return s;
}

void push_back(List *list, ElemType x)
{
	Node *s = buy_node(x);
	list->last->next = s;
	list->last       = s;
	list->last->next = list->first;
	list->size++;
}



void push_front(List *list, ElemType x)
{
	Node *s           = buy_node(x);
	s->next           = list->first->next;
	list->first->next = s; 
	if(list->size == 0)
	{
		list->last = s;
		list->last->next = list->first;
	}
	list->size++;
}


void pop_back(List *list)
{
	if(list->size == 0)
	{
		printf("链表已空，无法删除。\n");
		return;
	}
	Node *s = list->last;
	while(s->next != list->last)
	{
		s = s->next;
	}  
	free(s->next);
	list->last = s;
	list->last->next = list->first;
}	
	

void pop_front(List *list)
{
		
	if(list->size == 0)
	{
		printf("链表已空，无法删除。\n");
		return;
	}
	Node *s = list->first->next;
	free(list->first->next);
	list->first->next = s->next;
	if(list->size == 1)
	{
		list->last = list->first;
		list->last->next = list->first;
	}
	list->size--;
}

2.3 main

#include "SCList.h"

int main()
{
	List mylist;
	InitSCList(&mylist);

	ElemType Item;
	int select = 1;
	while(select)
	{
		printf("*********************************\n");
		printf("* [1] push_back  [2] push_front *\n");
		printf("* [3] show_list  [4] pop_back   *\n");
		printf("* [5] pop_front  [6] insert_val *\n");
		printf("* [7] find       [8] length     *\n");
		printf("* [9] delete_val [10] sort      *\n");
		printf("* [11] resver    [12] clear     *\n");
		printf("* [13] destroy   [0] quit       *\n");
		printf("*********************************\n");
		printf("请选择:>");
		scanf("%d", &select);
		
		switch(select)
		{
			case 1:
				printf("请输入要插入的数据（-1结束）：");
				while(scanf("%d",&Item), Item != -1)
				{
					push_back(&mylist, Item);
				}
				break;			
			case 2:			
				printf("请输入要插入的数据（-1结束）：");
				while(scanf("%d",&Item), Item != -1)
				{
					push_front(&mylist, Item);
				}
				break;
			case 3:
				show(&mylist);
				break;
			case 4:
				pop_back(&mylist);
				break;
			case 5:
 				pop_front(&mylist);
				break;
			default:
				break;
		}
		
	}
	return 0;
}

3. 结果

3.1 尾插和显示表

3.2 头插

3.3 尾删和头删

总结

接下来做剩下的部分。