数据结构复习 ——线性表

#include <iostream>
#include<stdlib.h>
using namespace std;
#define maxsize 10
typedef int elemtype;
/*struct xlist
{
    elemtype *elem;
    int length;
};
int createxlist(xlist &k)           ##顺序表
{
    k.elem = new elemtype[maxsize];
    if (!k.elem)
        exit(1);
    for (int i = 0; i < maxsize; i++)
    {
        k.elem[i] = 0;
    }
    k.length = 0;
    return 0;
}
int insertdata(xlist &k, int b,elemtype n[])
{
    cout << " 25";
    for (int i = 0; i < b; i++)
    {
        if (k.elem[i]==0)
        {
            k.elem[i] = n[i];
            k.length++;
        }
    }
    return 0;
}
int output(xlist k)
{
    for (int i = 0; i < k.length; i++)
    {
        cout << k.elem[i]<<" ";
    }
    return 0;
}
int main()
{
    xlist k;
    createxlist(k);
    int t = 5,n[5],b;
    for(int i=0;i<t;i++)
    cin >> n[i];
    insertdata(k, t, n);
    output(k);
    return 0;
}                   */     



/*typedef struct lnode                链表
{
    elemtype data;
    lnode *next;

}lnode,*linklist;*/
/*int createlinklist(linklist &h,int t,int n[])              #￥前插法
{
    h = new lnode;
    h->next = NULL;
    lnode* p;
    for (int i = 0; i < t; i++)
    {
        p = new lnode;
        p->data = n[i];
        p->next = h->next;
        h->next = p;
    }
    return 0;
}*/
/*int createlinklist(linklist &h, int t, int n[])           后插法
{
    h = new lnode;
    h->data = -maxsize;
    h->next = NULL;
    lnode *p,*r;
     r = h;
    for (int i = 0; i < t; i++)
    {
        p = new lnode;
        p->data = n[i];
        p->next = NULL;
        r->next = p;
        r = p;
    }
    return 0;
}*/
/*void output(linklist h)
{
    h = h->next;
    while (h->next!= NULL)
    {
        cout << h->data;
        h = h->next;
    }
    cout << h->data;
}*/

/*void outputsinglelist(linklist h)
{
    h = h->next;             因为头结点数值不赋予就是乱码不是NULL，和它的Next域也不是NULL，因此输出时需控制
    while (h->data!=-maxsize)
    {
        cout << h->data << " ";
        h = h->next;
        
    }
}
void singlecircle(linklist &h, linklist &k)         两个单链表合成一个循环链表
{
    lnode *A, *B,*p;
    A = h;
    B = k;
    while (h->next != NULL)
    {
        h = h->next;
    }
    h->next = A;
    while (k->next != NULL)
    {
        k = k->next;
    }
    k->next = B; 
    p = k->next->next;
    k->next = h->next;
    h->next = p;
    h = A;
    delete B;
}*/
typedef struct doublelist
{
    elemtype data;
    doublelist *prior,*next;
}doublelist,*dlinklist;
int createdlinklist(dlinklist& k,int t,int n[])
{
    doublelist *r,*p;
    k = new doublelist;
    k->data = -maxsize;
    k->next = NULL;
    r = k;
    for (int i = 0; i < t; i++)
    {
        p = new doublelist;
        p->data = n[i];
        p->prior = r;
        p->next =NULL;
        r->next = p;
        r = p;
    }
    r->next = k;
    return 0;
}
void outputdoublelist(dlinklist h)
{
    h = h->next;
    while (h->data != -maxsize)
    {
        cout << h->data<<" ";
        h = h->next;
    }
}
int main()
{
    dlinklist h,k;
    int t = 5, n[5];
    for (int i = 0; i < t; i++)
        cin >> n[i];
    createdlinklist(h, t, n);
    /*createlinklist(k, t, n);
    singlecircle(h, k); 
    outputsinglelist(h);*/
    outputdoublelist(h);
    return 0;
}