3.3

最新推荐文章于 2016-09-20 19:56:48 发布

zhenzhenjiajia888

最新推荐文章于 2016-09-20 19:56:48 发布

阅读量319

点赞数

分类专栏：数据结构与算法分析 c（习题）

本文链接：https://blog.csdn.net/superna666/article/details/52350400

版权

数据结构与算法分析 c（习题）专栏收录该内容

11 篇文章 1 订阅

订阅专栏

——————————a————————

#include <iostream>
#include <stdlib.h>
#define MAX 8
using namespace std;
typedef struct node
{
    int num;
    struct node* pnext;
}qnode,*pnode;
pnode init()
{
    int i=MAX,num_;
    pnode head,p,q;
    head=(pnode)malloc(sizeof(qnode));
    head->pnext=NULL;
    q=head;
    while(i--)
    {
        p=(pnode)malloc(sizeof(qnode));
        cin>>num_;
        p->num=num_;
        q->pnext=p;
        q=p;
    }
    q->pnext=NULL;
    return head;
}
void traverse(pnode head)
{
    pnode q=head->pnext;
    while(q!=NULL)
    {
        cout<<q->num;
        q=q->pnext;
    }
}
pnode find(pnode head,int pos)
{
    pnode q=head;
    int i;
    for(i=0;i<(pos-1);i++)
    {
        q=q->pnext;
    }
    return q;
}
pnode find_(pnode head,int pos)
{
    pnode q=head;
    int i;
    for(i=0;i<pos;i++)
    {
        q=q->pnext;
    }
    return q;
}
void exchange(pnode head,int pos,int pos_)
{
    pnode p,q,p_,q_;
    p=find(head,pos);
    p_=p->pnext;
    q=find_(head,pos_);
    q_=q;
    q=q->pnext;
    p->pnext=q_;
    q_->pnext=p_;
    p_->pnext=q;
}
int main()
{
    pnode head;
    head=init();
    exchange(head,4,5);
    traverse(head);
}

——————————b————————————————

#include <iostream>
#include <stdlib.h>
#define MAX 8
using namespace std;
typedef struct node
{
    int num;
    struct node* prior;
    struct node* pnext;
}qnode,*pnode;
pnode init()
{
    int i=MAX,num_;
    pnode head,p,q;
    head=(pnode)malloc(sizeof(qnode));
    head->pnext=NULL;
    q=head;
    while(i--)
    {
        p=(pnode)malloc(sizeof(qnode));
        cin>>num_;
        p->num=num_;
        q->pnext=p;
        p->prior=q;
        q=p;
    }
    q->pnext=NULL;
    return head;
}
void traverse(pnode head)
{
    pnode q=head->pnext;
    while(q!=NULL)
    {
        cout<<q->num<<' ';
        q=q->pnext;
    }
}
pnode find(pnode head,int pos)
{
    pnode q=head;
    int i;
    for(i=0;i<(pos-1);i++)
    {
        q=q->pnext;
    }
    return q;
}
pnode find_(pnode head,int pos)
{
    pnode q=head;
    int i;
    for(i=0;i<pos;i++)
    {
        q=q->pnext;
    }
    return q;
}
void exchange(pnode head,int pos,int pos_)
{
    pnode p,q,p_,q_;
    p=find(head,pos);
    p_=p->pnext;
    q=find_(head,pos_);
    q_=q;
    q=q->pnext;
    p->pnext=q_;
    q_->prior=p;
    q_->pnext=p_;
    p_->prior=q_;
    p_->pnext=q;
    q->prior=p_;
}
int main()
{
    pnode head;
    head=init();
    exchange(head,4,5);
    traverse(head);
}