线性表 c++语言代码,线性表C++的两种实现(顺序表示、单链表)

[C++] 纯文本查看 复制代码bool InitList(LinkList &L) {

L = new LNode;

if (L == NULL) return false;

L->next = NULL;

return true;

}

int Length(LinkList L) {

LNode *p = L;

int i = 0;

while (p->next != NULL) {

p = p->next;

i++;

}

return i;

}

int LocateElem(LinkList L, int e) {

LNode *p = L->next;

for (int i = 1; p != NULL; ++i) {

if (p->data == e) return i;

p = p->next;

}

return -1;

}

LNode *GetElem(LinkList L, int i) {

if (i < 0) return NULL;

LNode *p = L;

for (int j = 0; p != NULL && j < i; j++)

p = p->next;

return p;

}

bool InsertNextNode(LNode *p, int e) {

if (p == NULL) return false;

LNode *s = new LNode;

if (s == NULL) return false;

s->data = e;

s->next = p->next;

p->next = s;

return true;

}

bool ListInsert(LinkList &L, int i, int e) {

if (i < 1) return false;

LNode *p = GetElem(L, i - 1);

return InsertNextNode(p, e);

}

bool ListDelete(LinkList &L, int i, int &e) {

if (i < 1) return false;

LNode *p = GetElem(L, i - 1);

if (p == NULL || p->next == NULL) return false;

LNode *q = p->next;

e = q->data;

p->next = q->next;

delete q;

return true;

}

void PrintList(LinkList L) {

LNode *p = L->next;

for (int i = 0; p != NULL; i++) {

std::cout << "线性表第" << i << "个位置的元素为：" << p->data << std::endl;

}

}

bool Empty(LinkList L) {

return L->next != NULL ? true : false;

}

void DestoryList(LinkList &L) {

LNode *p = L;

LNode *temp;

while (p != NULL) {

temp = p;

p = p->next;

delete temp;

}

}