数据结构 链式存储结构

单链表 单链循环表

#include<cstdio>
#include<iostream>
using namespace std;

typedef struct link
{
    int data;
    link *next;
}link;

link *Link = new link;

void back_create(link **p,int n)
{
    link *t;
    t = *p;
    for(int i = 0; i < n; i++)
    {
        link *s = new link;
        scanf("%d",&s->data);
        t->next = s;
        t = s;
    }
    t->next = *p; 
    //printf("%d ",t->next->data);//循环链表(尾插法)
    //t->next =NULL;
}

void front_create(link **p,int n)
{
    link *h,*t;
    h = *p;
    for(int i = 0; i < n; i++)
    {
        link *s = new link;
        scanf("%d",&s->data);
        s->next = h->next;
        h->next = s;
        /*if(s->next == NULL)
            s->next = *p;*/   //循环链表(头插法)
    }
}

void insert(link **p,int pos)
{
    link *h;
    link *s = new link;
    h = *p;
    for(int i = 0; i < pos; i++)
        h = h->next;
    scanf("%d",&s->data);
    s->next = h->next;
    h->next = s;
}

void Delete(link **p,int pos)
{
    link *h,*s;
    h = *p;
    for(int i = 0; i < pos; i++)
        h = h->next;
    s = h->next;
    h->next = s->next;
    free(s);
}

void display(link *p)
{
    for(p = Link->next; p!=NULL; p=p->next)
            printf("%d ",p->data);
}

int main()
{
    int n,pos;
    while(scanf("%d",&n)!=EOF)
    {
        link *p;
        Link->next = NULL;
        back_create(&Link,n);
        //front_create(&Link,n);
        display(Link);

        scanf("%d",&pos);
        insert(&Link,pos);
        display(Link);

        scanf("%d",&pos);
        Delete(&Link,pos);

        display(Link);
    }
    return 0;
}

双向链表 双向循环链表

#include<cstdio>
#include<iostream>
using namespace std;

typedef struct dlink
{
    int data;
    dlink *prior;
    dlink *next;
}dlink;

dlink *Dlink = new dlink;

void front_create(dlink **p,int n)
{
    dlink *h,*t;
    h = *p;
    for(int i = 0; i<n; i++)
    {
        dlink *s = new dlink;
        scanf("%d",&s->data);
        s->next = h->next;
        h->next = s;
        s->prior =  h;
        t = s;
    }
     /*t->next = *p;
     (*p)->prior = t;*/
     //printf("%d ",(*p)->data);
     //printf("%d ",(*p)->prior->data);
}

void back_create(dlink **p,int n)
{
    dlink *h,*t;
    h = *p;
    for(int i = 0; i < n; i++)
    {
        dlink *s = new dlink;
        scanf("%d",&s->data);
        h->next = s;
        s->prior = h;
        h = s;
    }
    h->next = NULL;
    /*(*p)->prior = h;
    h->next = *p;*/
    //printf("%d ",(*p)->prior->data);
}

void insert(dlink **p,int pos)
{
    dlink *h;
    h = *p;
    for(int i = 0; i<pos; i++)
        h = h->next;
    dlink *s = new dlink;
    scanf("%d",&s->data);
    s->next = h->next;
    h->next = s;
    s->prior = h;
        //printf("%d\n",h->next->prior->data);
}

void del(dlink **p,int pos)
{
    dlink *h,*d;
    h = (*p);
    for(int i = 0; i < pos; i++)
        h = h->next;

    d = h->next;
    h->next = d->next;
    if(d->next != NULL) 
        d->next->prior = h;
   
    //printf("%d\n",h->next->prior->data);
    free(d);
}

void display(dlink **p)
{
     dlink *h;
     for(h = (*p)->next; h!=NULL; h=h->next)
            printf("%d ",h->data);
        printf("\n");
}

int main()
{
    int n,pos;
    while(scanf("%d",&n)!=EOF)
    {
        dlink *p,*k;
        Dlink->next = Dlink->prior =NULL;
        
        front_create(&Dlink,n);
        //back_create(&Dlink,n);
        display(&Dlink);

        scanf("%d",&pos);
        insert(&Dlink,pos);
        display(&Dlink);

        scanf("%d",&pos);
        del(&Dlink,pos);
        display(&Dlink);
       
    }
    return 0;
}