单链表的创建（无表头 头插法）

#define LEN sizeof(node)
typedef struct Node{
	int data;
	struct Node * next;
}node;//定义结点node
node * creat_link(int n){
	node * head = (node *)malloc(LEN);
	node * h = (node *)malloc(LEN);
	h = head;
	head->next = NULL;
	for (int i = 1; i <=n; i++){
		node * p = (node *)malloc(LEN);
		h->data = i;
		p->next = h;
		h= p;
	}
	return h->next;
}

void printf_link(node *head,int n){
	node * p = (node *)malloc(LEN);
	p = head;
	while(p){
		printf("%d\n", p->data);
		p = p->next;
	}
}
int main(){

	node * head = (node*)malloc(LEN);
	 head = creat_link(10);
	printf_link(head,10);
    return 0;
}