题解 | #牛牛的单向链表#

#include<stdio.h>
#include<stdlib.h>
typedef struct Node {
	int data;
	Node* next;
}Node;
Node* head;
void insert(int x) {
	Node* temp = new Node();
	temp->data = x;
	temp->next = NULL;
	head = temp;
	Node* temp2 = head;
	while (temp2->next!= NULL)
	{
		temp2= temp2->next;
	}
	temp2->next = temp;
	temp->next=NULL;
}
void print() {
	Node* temp = head;
	while (temp!= NULL)
	{
		printf("%d ", temp->data);
		temp = temp->next;
	}

}
int main()
{
	int n;
	head = NULL;
	scanf("%d", &n);
	int i,x;
	for (i = 0; i < n; i++)
	{
		scanf("%d", &x);
		insert(x);
		print();
	}
	
	return 0;
}