链表尾插法

# include
# include
using namespace std;

typedef struct node
{
	int data;
	struct node * next;
}Node;

//尾插法，需要引入第三方变量，保证头指针起到定海神针的作用，最后将头结点的指针返回给头指针
Node * creat_list_end()
{
	Node * head = (Node*)malloc(sizeof(Node));
	head->next = NULL;
	Node * cur = NULL;
	Node * pt = head;
	int data;
	printf("请输入节点数据：\n");
	scanf("%d", &data);

	while (data)
	{
		cur = (Node *)malloc(sizeof(Node));
		cur->data = data;
		cur->next = NULL;
		pt->next = cur;
		pt = cur;//逻辑上只能提供这么多想法，但这种书写方式比较易记，我也就暂时先这样记忆
		scanf("%d", &data);
	}
	return head;
}
void show_list(Node * head)
{
	Node * phead = head->next;
	while (phead)
	{
		printf("%d\n", phead->data);
		phead = phead->next;
	}
}

int main()
{
	Node * head = (Node *)malloc(sizeof(Node));
	
	head = creat_list_end();
	show_list(head);


	return 0;
}