单向链表

教材P312

#include <stdio.h>
#include <stdlib.h>

struct s_list
{
	int date ;
	struct s_list *next;

};

void creat_list_v1(struct s_list **headp,int *p)
{
	struct s_list * loc_head = NULL,*tail;
	if(p[0]==0);
	else
	{
		loc_head = (struct s_list *)malloc(sizeof(struct s_list));
		loc_head -> date = *p++;
		tail = loc_head;
		while(*p)
		{
			tail -> next = (struct s_list *)malloc(sizeof(struct s_list));
			tail = tail -> next;
			tail -> date = *p++;
		}
		tail -> next = NULL;
	}
	*headp = loc_head;

}

int main()
{
	struct s_list *head = NULL,*p;
	int s[] = {1,2,3,4,5,6,7,8,0};
	creat_list_v1(&head,s);
	p = head;
	while(p)
	{
		printf("%d\t",p->date);
		p = p -> next;
	}
	return 0;
}