!!!!! 代码有bug,请注意。。
实现代码
#include<stdio.h>
#include<stdlib.h>
//定义linklist结构体类型
typedef struct linklist
{
int data;
struct linklist *next;
}list, *plist;//建立一个结构体list及linklist结构体类型指针
//头插法建链表
void head_insert(plist *head, plist *tail, int num)
{
plist p_new = (plist)malloc(sizeof(list));//堆上分配空间
p_new->data = num;//新元素data设为num
p_new->next = NULL;//将新元素next置为空
if (*head == NULL )//若为空表,头尾指针指向新插入的元素
{
*head = p_new;
*tail = p_new;
}
else //非空表时
{
p_new->next = *head;//新元素的next指向head(即表头)
*head = p_new; //将新元素设为头结点
}
}
//打印链表数据
void print_list(plist head)
{
plist elem;
elem = head;//指向首元素地址
while (elem != NULL)
{
printf("%d ", elem->data);
elem = elem->next;//依次向后移动直至为NULL
}
}
void main()
{
int number;//插入的元素
plist head, tail;
head = NULL;//定义后设为空
tail = NULL;//定义后设为空
printf("input some numbers:\n");
scanf("%d",&number);//number赋初值
while (number!=-1) //输入-1终止输入
{
head_insert(&head, &tail,number);
scanf("%d", &number);
}
printf("链表打印输出:\n");
print_list(head);
system("pause");
}