数据结构掌握线性表的顺序表和链表的基本操作：建立、插入、删除、查找、合并、打印等运算。

一、     实验目的

 掌握线性表的顺序表和链表的基本操作：建立、插入、删除、查找、合并、打印等运算。

一、  源程序

顺序表：

#include<iostream>
using namespace std;
#define OK 1
#define OVERFLOW -1
#define ERROR 0
#define MAXSIZE 100
int typedef Status;
typedef struct//定义结构体
{
    int *elem;
    int length;
}SqList;
Status InitList(SqList &L)//顺序表的初始化
{
    L.elem = new int[MAXSIZE];//分配一个数组空间
    if (!L.elem)exit(OVERFLOW);
    L.length = 0;
    return OK;
}
Status GetElem(SqList L, int i, int &e)//顺序表的取值
{
    if (i<1 || i>L.length)return ERROR;
    e = L.elem[i - 1];//[i-1]存储大第[i]个元素
    return OK;
}
int LocateElem(SqList L, int e)//查找
{
    for (int i=0; i < L.length; i++)
    {
        if (L.elem[i] == e)return i + 1;
    }
    return 0;
}
Status ListInsert(SqList &L, int i, int e)//插入
{
    if ((i<1) || (i>L.length + 1))return ERROR;
    if (L.length == MAXSIZE)return ERROR;
    for (int j = L.length - 1; j>i - 1; j--)
    {
        L.elem[j + 1] = L.elem[j];
    }
    L.elem[i - 1] = e;
    ++L.length;
    return OK;
}
Status ListDelete(SqList &L, int i)//删除
{
    if ((i<1) || (i>L.length))return ERROR;
    for (int j = i; j < L.length - 1; j++)
    {
        L.elem[j - 1] = L.elem[j];//是第i个但在数组里是第i-1个
    }
    --L.length;
    return OK;
}
void MergeList_Sq(SqList LA, SqList LB, SqList &LC)//有序表的合并
{
    LC.length = LA.length + LB.length;
    LC.elem = new int[LC.length];
    int *pc = LC.elem;
    int *pa = LA.elem;
    int *pb = LB.elem;
    int *pa_last = LA.elem + LA.length - 1;//指向最后一个元素
    int *pb_last = LB.elem + LB.length - 1;
    while ((pa <= pa_last) && (pb <= pb_last))
    {
        if ((pa <= pa_last) && (pb <= pb_last))
        
            if (*pa <= *pb) *pc++ = *pa++;
            else *pc++ = *pb++;
        
        
    }
        while (pa <= pa_last)*pc++= *pa++;
        while (pb <= pb_last)*pc++ = *pb++;
    
}
int main()
{
    SqList N, M;
    InitList(N);
    InitList(M);
    cout << "请输入第一个数组的长度" << endl;;
    cin >> N.length;
    cout << "请依次输入1到" << N.length << "的数据" << endl;
    for (int i = 0; i < N.length; i++)
    {
        cin >> N.elem[i];
    }
    cout << "请输入第二个数组的长度" << endl;;
    cin >> M.length;
    cout << "请依次输入1到" << M.length << "的数据" << endl;
    for (int i = 0; i < M.length; i++)
    {
        cin >> M.elem[i];
    }
    SqList A;
    MergeList_Sq(N, M, A);
    for (int i = 0; i < A.length; i++)
    {
        cout << A.elem[i] << endl;
    }
}

约瑟夫退圈

#include<iostream>
using namespace  std;
#define OK 1
#define OVERFLOW -1
#define ERROR 0
#define MAXSIZE 100
int typedef Status;
typedef struct LNode//循环链表定义
{
    int data;
    int num;
    struct LNode *rear;
}LNode,*LinkList;
Status InitList(LinkList &L)//循环链表初始化
{
    L = new LNode;
    L->rear = L;
    L->num = 0;
    return OK;
}
Status GetElem(LinkList L, int i, int &e)//取值
{
    LNode *p = L->rear; int j = 1;
    while (p&&j < i)//是否要有p
    {
        p = p->rear;
        ++j;
    }
    if (!p || j>i)return ERROR;
    e = p->data;
    return OK;
}
LNode *LocateElem(LinkList L, int e)//查找
{
    LNode *p = L->rear;
    while (p&&p->data != e)//是否要有p
    {
        p = p->rear;
    }
    return p;
}
Status LisrInsert(LinkList &L, int i, int e)//插入
{
    LNode *p = L; int j = 0;
    while (p && (j < i - 1))
    {
        p = p->rear;
        ++j;
    }
    if (!p || j>i - 1)return ERROR;
    LNode *s = new LNode;
    s->data = e;
    s->rear = p->rear;
    p->rear = s;
    return OK;
}
Status ListDelete(LinkList &L, int i)//删除
{
    LNode*p = L; int j = 0;
    while ((p->rear) && (j < i - 1))
    {
        p = p->rear; ++j;
    }
    if ( (j>i - 1))return ERROR;
    LNode *q = p->rear;
    p->rear = q->rear;
    delete q;
    return OK;
}
int main()
{
    LinkList N;
    LNode *t = NULL, *head;
    InitList(N);
    head = N->rear;
    int n;
    int A[MAXSIZE];
    cout << "请输入有几名学生：" << endl;
    cin >> n;
    int j = 0,i,a=0;
    while (j < n)
    {
        A[a] = (a + 1);        
        cout <<"第"<<A[a]<< "人，请输入密码：" << endl;
        cin >> i;
        t = new LNode;
        t->data = i;
        t->rear = N;
        head->rear = t;
        head = t;
        ++j;
        ++a;
        ++t->num;
    }
    cout << "约瑟夫环的人数以及对应密码分别是：" << endl;
    j = 0;
    head = N->rear;
    while (j<n)
    {
        cout << "第" << A[j] << "个人，密码" << head->data << endl;
        head = head->rear;
        ++j;
    }
    cout << "请输入您想要从几开始删除：" << endl;
    int m; cin >> m;
    //N = N->rear;
    ListDelete(N, m);
    j = 0;
    while (j<n)
    {
        cout << "第" << A[j] << "个人，密码" << head->data << endl;
        head = head->rear;
        ++j;
    }
    }