#include<stdio.h>
#include<stdlib.h>
typedef int elemtype;
typedef struct LNode
{
elemtype data;
struct LNode* next;
}LNode,*Listlink;
LNode* Creatlist1(Listlink& l, elemtype n) //头插法创建链表
{
LNode* q;
int x;
l = (LNode*)malloc(sizeof(LNode));
l->next = NULL;
printf("请输入你要插入的数:\n");
for (int i = 0; i < n; i++)
{
q = (LNode*)malloc(sizeof(LNode));
scanf_s("%d", &x);
q->data = x;
q->next = l->next;
l->next = q;
}
return l;
}
LNode* Creatlist2(Listlink& l, elemtype n) //尾插法创建链表
{
LNode* q,*r; int x;
l = (LNode*)malloc(sizeof(LNode));
r = l;
l->next = NULL;
printf("请输入你要插入的数:\n");
for (int i = 0; i < n; i++)
{
q = (LNode*)malloc(sizeof(LNode));
scanf_s("%d", &x);
q->data = x;
r->next = q;
r=q;
}
r->next = NULL;
return l;
}
void printflist(Listlink l) //打印链表
{
l = l->next;
while (l!= NULL)
{
printf("%4d", l->data);
c语言数据结构单链表
最新推荐文章于 2024-05-14 20:04:33 发布