#include <stdio.h>
#include <iostream>
using namespace std;
#include <stdlib.h>
typedef struct LNode
{
int data;
struct LNode *next;
} LNode, *LNodeList;
void InitList_Head(LNodeList &L) // 头插法
{
L = new LNode;
L->data = 0;
L->next = NULL;
for (int i = 0; i < 10; i++)
{
LNodeList s = new LNode;
s->data = i;
s->next = L->next;
L->next = s;
}
}
void InitList_Tear(LNodeList &L) // 尾插法
{
L = new LNode;
// L->data = 0;
LNodeList r = L;
L->next = NULL;
for (int i = 0; i < 10; i++)
{
LNodeList s = new LNode;
// cin >> s->data;
s->data = i;
s->next = nullptr;
r->next = s;
r = s;
}
}
void printf(LNodeList L) // 打印链表
{
LNodeList q = L->next;
int i = 0;
while (q != NULL)
{
printf("%d ", q->data);
i++;
q = q->next;
}
printf("链表长度:%d\n", i);
}
int main()
{
LNodeList myList;
InitList_Head(myList); // 头插法
InitList_Tear(myList); // 尾插法
printf(myList);
}
运行结构如下