2020-10-18

初始化一个空链表，并且动态的插入数据

1. 节点的插入
2. 节点的遍历
3. 节点的删除

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

typedef struct node {
	int val ;
	struct node * p_next;

} node_t;
int main()
{
	int val = 0;
	node_t  head = {0},tail = {0};
	node_t * p_node = NULL, *p_first = NULL, *p_mid = NULL, *p_last = NULL, *p_tmp = NULL;
	head.p_next = &tail;
	while (1)
	{
		printf("input a num : ");
		scanf("%d", &val);
		if (val < 0)
			break;
//		printf("%d \n",__LINE__);
		p_node = (node_t *)malloc(sizeof(node_t));
		p_node->val = val;
		p_node->p_next = NULL;
		//  insert node into list
		for(p_tmp = &head; p_tmp != &tail; p_tmp = p_tmp->p_next)
		{
			p_first = p_tmp;
			p_mid = p_first->p_next;
			p_last = p_mid->p_next;
//			printf("%d \n",__LINE__);
			if (p_mid == &tail || p_mid->val >=  p_node->val)
			{
				p_first->p_next = p_node;
				p_node->p_next = p_mid;
	//			printf("##%d  \n",p_node->val );
				break;
			}	
		}
	}
	for(p_tmp = &head; p_tmp != &tail; p_tmp = p_tmp->p_next )
	{
		p_first = p_tmp;
		p_mid = p_first->p_next;
		p_last = p_mid->p_next;
		if (p_mid != &tail)
			printf("%d  ",p_mid->val);	
	}
	printf("\n");
	// free node
	while(head.p_next != &tail)
	{
		p_first = &head;
		p_mid = p_first->p_next;
		p_last = p_mid->p_next;	
		p_first->p_next = p_last;
		free(p_mid);
		p_mid = NULL;
	}
	return 0;
}