C++单链表
#include <iostream>
using namespace std;
struct LNode;
using ElemType = int;
using LinkList = LNode*;
using LNode = struct LNode
{
ElemType data;
LNode* next;
};
bool InitList(LinkList& L)
{
L = nullptr;
return true;
}
bool Empty(LinkList L)
{
return (L == nullptr);
}
bool ListInsert(LinkList& L, int i, ElemType e)
{
if (i < 1)
{
return false;
}
if (i == 1)
{
LNode* s = new LNode;
s->data = e;
s->next = L;
L = s;
return true;
}
LNode* p = L;
int j = 1;
while (p != nullptr && j < i - 1)
{
p = p->next;
j++;
}
if (p == nullptr)
{
return false;
}
LNode* s = new LNode;
s->data = e;
s->next = p->next;
p->next = s;
return true;
}
bool InitListHead(LinkList& L)
{
L = new LNode;
if (L == nullptr)
{
return false;
}
L->next = nullptr;
return true;
}
bool HeadEmpty(LinkList L)
{
return (L->next == nullptr);
}
bool ListInsert(LinkList& L, int i, ElemType e)
{
if (i < 1)
{
return false;
}
LNode* p = L;
int j = 0;
while (p != nullptr && j < i - 1)
{
p = p->next;
j++;
}
if (p == nullptr)
{
return false;
}
LNode* s = new LNode;
s->data = e;
s->next = p->next;
p->next = s;
return true;
}
bool InsertNextNode(LNode* p, ElemType e)
{
if (p == nullptr)
{
return false;
}
LNode* s = new LNode;
if (s == nullptr)
{
return false;
}
s->data = e;
s->next = p->next;
p->next = s;
return true;
}
bool InsertNextNode(LNode* p, ElemType e)
{
if (p == nullptr)
{
return false;
}
LNode* s = new LNode;
if (s == nullptr)
{
return false;
}
s->data = p->data;
p->data = e;
s->next = p->next;
p->next = s;
return true;
}
bool ListDelete(LinkList& L, int i, ElemType &e)
{
if (i < 1)
{
return false;
}
LNode* p = GetElem(L, i - 1);
if (p == nullptr || p->next == nullptr)
{
return false;
}
LNode* q = p->next;
p->next = q->next;
e = q->data;
delete q;
return true;
}
bool DeleteNode(LNode* p)
{
if (p == nullptr)
{
return false;
}
LNode* s = p->next;
p->data = p->next->data;
p->next = s->next;
delete s;
return true;
}
LNode* GetElem(LinkList L, int i)
{
if (i < 0)
{
return nullptr;
}
LNode* p = L;
int j = 0;
while (p != nullptr && j < i)
{
p = p->next;
j++;
}
return p;
}
LNode* LocatElem(LinkList L, ElemType e)
{
LNode* p = L->next;
while (p != nullptr && p->data != e)
{
p = p->next;
}
return p;
}
int Length(LinkList L)
{
int len = 0;
LNode* p = L;
while (p->next != nullptr)
{
p = p->next;
len++;
}
return len;
}
LinkList List_TailInert(LinkList& L)
{
int x = 0;
L = new LNode;
L->next = nullptr;
LNode* r = L;
cin >> x;
while (x != 9999)
{
LNode* s = new LNode;
s->data = x;
r->next = s;
r = s;
cin >> x;
}
r->next = nullptr;
return L;
}
LinkList List_HeadInert(LinkList& L)
{
int x = 0;
L = new LNode;
L->next = nullptr;
cin >> x;
while (x != 9990)
{
LNode* s = new LNode;
s->data = x;
s->next = L->next;
L->next = s;
cin >> x;
}
return L;
}
void test()
{
LinkList L;
InitList(L);
}
int main()
{
return 0;
}