链表的逆序输出--头插法

头插法

struct ListNode *createlist()
{
	struct ListNode *head = NULL, *newNode = NULL;
	int a;
	
	while(1)
	{
		scanf("%d", &a);
		if(a == -1){
			return head;
		}else{
			newNode = (struct ListNode*)malloc(sizeof(struct ListNode));
			newNode->data = a;
			newNode->next = head;
			head = newNode;
		}
	}
}