数据结构学习第四课（线性表之单链表（升级版(再封装)））

线性表之单链表（升级版(再封装)）

typedef int Data;
typedef struct _Node
{
	Data data;  //数据域
	struct _Node* next;//指向后继节点的指针
}Node;
typedef struct _List
{
	int size;//记录当前节点数量
	Node* front;//指向头结点的指针；
	Node* tail;//指向尾结点的指针；
}List;
//创建一个链表
List* createList()
{
	List* list = malloc(sizeof(List));
	assert(list != NULL);

	Node* headNode = calloc(1, sizeof(Node));
	assert(list != NULL);
	headNode->next = NULL;
	headNode->data = -1;//头结点里面的数据域不存储任何东西

	list->front = headNode;
	list->tail = headNode;
	list->size = 0;
	return list;
}
//尾插
void push_back(List* list, Data data)
{
	Node* newNode = createNode(data);//让尾结点指向新结点
	list->tail->next = newNode;//让尾指针始终指向最后一个结点
	list->tail = newNode;
	list->size++;
}
//头插
void push_front(List* list, Data data)
{
	Node* newNode = createNode(data);
	newNode->next = list->front->next;
	list->front->next = newNode;
	list->size++;
}
//判断为空
bool empty(List* list)
{
	return list->front->next == NULL;
}
//尾删
void pop_back(List* list)
{
	if (empty(list))
	{
		return;
	}
	Node* curNode = list->front;
	while (curNode->next!=list->tail)
	{
		curNode = curNode->next;
	}
	free(curNode->next);
	curNode->next = NULL;
	list->tail = curNode;
	list->size--;
}
//头删
void pop_front(List* list)
{
	if (empty(list))
	{
		return;
	}
	Node* delNode =list->front->next;//暂存
	list->front->next = delNode->next;
	if (delNode->next == NULL)
	{
		list->tail = list->front;
	}
	free(delNode);
	list->size--;	
}
//清空
void destory(List** list)
{
	clear(*list);
	free((*list)->front);
	free(*list);
	*list = NULL;
}