单链表

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

/* 单链表 */


typedef struct node {
	int num;
	struct node* pt_next;
}T_node;

typedef struct {
	T_node t_head;
	T_node t_tail;
}T_link;

int init_link(T_link* pt_link);
int push_link_tail(T_link* pt_link, int newNum);
int push_link_head(T_link* pt_link, int newNum);
int pop_link_head(T_link* pt_link);
int pop_link_tail(T_link* pt_link);
int traverse_link(T_link* pt_link);
int destory_link(T_link* pt_link);


int init_link(T_link* pt_link)
{
	if (pt_link == NULL) return -1;
	pt_link->t_head.pt_next = &(pt_link->t_tail);
	pt_link->t_tail.pt_next = NULL;
	return 0;
}

int push_link_tail(T_link* pt_link, int newNum)
{
	if (pt_link == NULL) return -1;
	T_node* pt_newNode = (T_node*)malloc(sizeof(T_node));
	pt_newNode->num = newNum;
	pt_newNode->pt_next = NULL;
	T_node* pt_tmp;
	for (pt_tmp = &(pt_link->t_head); pt_tmp != &(pt_link->t_tail); pt_tmp = pt_tmp->pt_next)
	{
		T_node* pt_first = pt_tmp;
		T_node* pt_mid = pt_first->pt_next;
		T_node* pt_last = pt_mid->pt_next;
		if (pt_mid == &(pt_link->t_tail) || pt_link->t_head.pt_next == &(pt_link->t_tail))
		{
			pt_first->pt_next = pt_newNode;
			pt_newNode->pt_next = pt_mid;
		}
	}
	return 0;
}

int push_link_head(T_link* pt_link, int newNum)
{
	if (pt_link == NULL) return -1;
	T_node* pt_first = &(pt_link->t_head);
	T_node* pt_mid = pt_first->pt_next;
	T_node* pt_last = pt_mid->pt_next;

	T_node* pt_newNode = (T_node*)malloc(sizeof(T_node));
	pt_newNode->num = newNum;
	
	pt_first->pt_next = pt_newNode;
	pt_newNode->pt_next = pt_mid;

	return 0;
}

int pop_link_head(T_link* pt_link)
{
	if (pt_link == NULL) return -1;
	T_node* pt_first = &(pt_link->t_head);
	T_node* pt_mid = pt_first->pt_next;
	T_node* pt_last = pt_mid->pt_next;
	pt_first->pt_next = pt_last;
	free(pt_mid);
	pt_mid = NULL;
	return 0;
}

int pop_link_tail(T_link* pt_link)
{
	if (pt_link == NULL) return -1;
	T_node* pt_tmp;
	for (pt_tmp = &(pt_link->t_head); pt_tmp != &(pt_link->t_tail); pt_tmp = pt_tmp->pt_next)
	{
		T_node* pt_first = pt_tmp;
		T_node* pt_mid = pt_first->pt_next;
		T_node* pt_last = pt_mid->pt_next;
		if (pt_last == &(pt_link->t_tail) && pt_link->t_head.pt_next != &(pt_link->t_tail))
		{
			pt_first->pt_next = pt_last;
			free(pt_mid);
			pt_mid = NULL;
		}
	}
	return 0;
}

int traverse_link(T_link* pt_link)
{
	if (pt_link == NULL) return -1;
	T_node* pt_first = &(pt_link->t_head);
	T_node* pt_mid = pt_first->pt_next;
	T_node* pt_node;
	for (pt_node = pt_mid; pt_node != &(pt_link->t_tail); pt_node = pt_node->pt_next)
		if(pt_node != &(pt_link->t_tail))	
			printf("%d\t", pt_node->num);
	printf("\n");
	return 0;
}

int destory_link(T_link* pt_link)
{
	if (pt_link == NULL); return -1;
	pt_link = NULL;
	free(pt_link);
}



int main()
{
	T_link pt_link = { 0 };
	init_link(&pt_link);
	traverse_link(&pt_link);
	push_link_tail(&pt_link, 1);
	push_link_tail(&pt_link, 2);
	push_link_tail(&pt_link, 3);
	push_link_tail(&pt_link, 4);
	push_link_head(&pt_link, 0);
	push_link_head(&pt_link, -1);
	push_link_head(&pt_link, -2);	traverse_link(&pt_link);
	pop_link_head(&pt_link);	traverse_link(&pt_link);
	pop_link_head(&pt_link);	traverse_link(&pt_link);
	pop_link_head(&pt_link);	traverse_link(&pt_link);
	pop_link_tail(&pt_link);	traverse_link(&pt_link);
	pop_link_tail(&pt_link);	traverse_link(&pt_link);
	pop_link_tail(&pt_link);	traverse_link(&pt_link);
	pop_link_tail(&pt_link);	traverse_link(&pt_link);
	pop_link_tail(&pt_link);	traverse_link(&pt_link);
	pop_link_tail(&pt_link);	traverse_link(&pt_link);
	pop_link_tail(&pt_link);	traverse_link(&pt_link);
	destory_link(&pt_link);
	system("pause");
	return 0;
}