带了头结点的尾插比不带头结点的尾插好写,不需要考虑刚开始r->next不存在的情况;
LinkList Init_head()
{
LinkList head = (LinkList)malloc(sizeof(LNode));
if (head == nullptr)return nullptr;
head->next = nullptr;
for (int i = 1; i < 10; ++i)
{
LinkList s = (LinkList)malloc(sizeof(LNode));
if (s == nullptr)return nullptr;
s->data = i;
s->next = head->next;
head->next = s;
}
return head;
}
LinkList Init_tail()
{
LinkList head = (LinkList)malloc(sizeof(LNode));
if (head == nullptr)return nullptr;
head->next = nullptr;
LinkList r = head;
for (int i = 1; i < 10; ++i)
{
LinkList s = (LinkList)malloc(sizeof(LNode));
if (s == nullptr)return nullptr;
s->data = i;
s->next = r->next;
r->next = s;
r = s;
}
r = nullptr;
return head;
}