线性表的链式存储

线性表的链式存储

头文件如下

//LinkList.h


#ifndef LINKLIST_H
#define LINKLIST_H

#define OK 1
#define ERROR 0;
typedef int Status;
typedef int ElemType;

typedef struct LNode {
    ElemType data;
    struct LNode *next;
}LNode,* LinkList;

Status GetElem(LinkList L, int i, ElemType &e);
Status ListInsert(LinkList &L, int i, ElemType e);
Status ListDelete(LinkList &L, int i, ElemType &e);
void CreateList(LinkList &L, int n);
void MergeList(LinkList &La, LinkList &Lb, LinkList &Lc);
void ListTraverse(LinkList &L);

#endif

链表操作的实现

//LinkList.cpp

#include"LinkList.h"
#include<iostream>
#include<cstdlib>

Status GetElem(LinkList L, int i, ElemType &e)
{
    LinkList p;
    p = L->next;
    int j = 1;
    while (p&&(j < i)) {
        p = p->next;
        ++j;
    }
    if (!p || j > i)
        return ERROR;
    e = p->data;
    return OK;
}

//当需要改变LinkList的值的时候，需要&引用
Status ListInsert(LinkList &L, int i, ElemType e)
//在带头结点的单链表中第i个位置之前插入元素e
{
    LinkList p;
    p = L;
    int j = 0;
    while (p&&j < i - 1)
    {
        p = p->next;
        ++j;
    }
    if (!p || j > i - 1)
        return ERROR;
    LinkList s = (LinkList)malloc(sizeof(LNode));
    s->data = e;
    s->next = p->next;
    p->next = s;
    return OK;
}

Status ListDelete(LinkList &L, int i, ElemType &e)
//在带头节点的单链表L中，删除第i个元素，并由e返回其值
{
    LinkList p = L;
    int j = 0;
    while (p->next&&j < i - 1) {//寻找第i个节点，并令p指向其前趋
        p = p->next;
        ++j;
    }
    if (!(p->next) || j > i - 1)
        return ERROR;
    LinkList q = p->next;     //删除并释放结点
    p->next = q->next;
    e = q->data;
    free(q);
    return OK;
}

void CreateList(LinkList &L, int n)
//逆序输入n个元素的值，建立带表头结点的单链线性表L.
{
    L = (LinkList)malloc(sizeof(LNode));
    L->next = NULL;    //建立一个带表头结点的单链表
    if(n>0)
        std::cout << "逆序输入链表元素值: " << std::endl;
    for (int i = n; i > 0; --i)
    {
        LinkList p = (LinkList)malloc(sizeof(LNode));//生成新结点
        std::cin >> p->data;
        p->next = L->next;
        L->next = p;//插入到表头
    }
}

void MergeList(LinkList &La, LinkList &Lb, LinkList &Lc)
//要求单链线性表La和Lb的元素按非递减排列
//归并La和Lb得到新的的单链线性表Lc，Lc的元素也按值
{
    LinkList pa = La->next;
    LinkList pb = Lb->next;
    LinkList pc = Lc=La;        //将La的头结点作为Lc的头结点
    while (pa&&pb)
    {
        if (pa->data <= pb->data)
        {
            pc->next = pa;
            pc = pa;
            pa = pa->next;
        }
        else
        {
            pc->next = pb;
            pc = pb;
            pb = pb->next;
        }
    }
    pc->next = pa ? pa : pb;
    free(Lb);
}

void ListTraverse(LinkList &L)
{
    LinkList q = L;
    q = q->next;
    while (q)
    {
        std::cout << q->data<<"  ";
        q = q->next;
    }
    std::cout << std::endl;
}

主函数实现

//Main.cpp

#include"LinkList.h"
#include<iostream>
using namespace std;

int main()
{
    LinkList La;
    LinkList Lb;
    LinkList Lc;

    CreateList(La, 4);
//    CreateList(Lb, 3);

//    ListTraverse(La);
//    ListTraverse(Lb);

//    MergeList(La, Lb, Lc);

//    cout << "Lc: ";
//    ListTraverse(Lc);

    LinkList L;
    ElemType n1 = 1;
    ElemType n2 = 2;
    ElemType n3 = 3;
    ElemType n4 = 4;
    ElemType n5 = 5;
    ElemType n6 = 6;
    ElemType n7 = 7;
    ElemType n8 = 8;
    ElemType n9 = 9;
    ElemType n0 = 0;
    ElemType temp = 0;

    ListInsert(La, 2, n9);
    ListTraverse(La);

    CreateList(L, 0);
    ListInsert(L, 1, n7);
    ListInsert(L, 2, n9);
    ListTraverse(L);


    system("pause");
    return 0;
}