创建链表的方法

头插法：

#include<stdio.h>
#include<stdlib.h>
struct node{
	int date;
	struct node *next;
};

int main()
{
	struct node *head,*p;
	int i,j,n;
	scanf("%d",&n);
	head = (struct node *)malloc(sizeof(struct node));
	head->next = NULL;
	for(i=0;i<n;i++){
		p = (struct node *)malloc(sizeof(struct node));
		scanf("%d",&j);
		p->date = j;
		p->next = head->next;
		head->next = p; 
	}
	
	while(p!=NULL){
		printf("%d ",p->date);
		p = p->next;
	}
	return 0;
}

尾插法：

#include<stdio.h>
#include<stdlib.h>
struct node{
	int date;
	struct node *next;
}; 

int main()
{
	struct node *head,*p,*q,*t; 
	int i,n;
	scanf("%d",&n);
	head = NULL;
	for(i=0;i<n;i++){
		p = (struct node *)malloc(sizeof(struct node));
		scanf("%d",&p->date);
		p->next = NULL;
		if(head==NULL)
			head = p;
		else
			q->next = p;
		q = p;
	}
	t = head;
	while(t!=NULL){
		printf("%d ",t->date);
		t = t->next;
	}
	return 0;
}

头插法和尾插法的另外两种实现：

#include<stdio.h>
#include<stdlib.h>
struct node{
	int date;
	struct node *next;
};

struct node *create(int n)
{
	struct node *head,*end,*p,*t;
	head=end=(struct node *)malloc(sizeof(struct node));
	head->next = NULL;
	while(n--){
		p = (struct node *)malloc(sizeof(struct node));
		scanf("%d",&p->date);
		end->next = p;
		end = p;
	} 
	p->next = NULL;
	
	t = head->next;
	while(t!=NULL){
		printf("%d ",t->date);
		t = t->next;
	}
	return head;
}

int main()
{
	int n;
	scanf("%d",&n);
	struct node *head = create(n);
}