BJFUOJ-233

双向循环链表中结点的交换

#include <iostream>
using namespace std;
typedef struct DbNode{
    int data;
    DbNode* lLink;
    DbNode* rLink;
    DbNode():data(0),lLink(nullptr),rLink(nullptr){};
    DbNode(int x):data(x),lLink(nullptr),rLink(nullptr){};
}DbNode,*DbLinkList;
DbLinkList DbTailInsert(int n){
    DbNode* head = new DbNode; //设置头结点
    head->lLink = head;
    head->rLink = head;
    DbNode* r = head;
    for(int i = 1;i<=n;i++){
        int x;
        cin>>x;
        DbNode* p = new DbNode (x);

        //尾插法 双向链表
        p->lLink = r;
        p->rLink = r->rLink;
        r->rLink->lLink = p;
        r->rLink = p;
        r = p;
    }
    return head;
}
//x为结点位置
void swap_node(DbLinkList L,int x){
    DbNode * p = L->rLink;
    DbNode * pre = L;
    DbNode * r = p;
    int i = 0;
    while (p != L){
        i++;
        if(i == x) break;
        pre = p;
        p = p->rLink;
    }
    if(p == L) return ;
    if(i == 1)return ;
    //交换 pre 和 p
    pre->lLink->rLink = p;
    pre->lLink = p;
    p->rLink->lLink = pre;
    pre->rLink = p->rLink;
    p ->rLink = pre;
}

void print(DbLinkList L){
    DbNode * p = L->rLink;
    while(p != L){
        cout<<p->data;
        if(p->rLink != L){
            cout<<" ";
        }
        p = p->rLink;
    }
    cout<<endl;
}

int main(){

    int n;
    while(cin >> n && n!=0){
        DbLinkList L = DbTailInsert(n);
        int x;
        cin>>x;
        swap_node(L,x);
        print(L);
    }


    return 0;
}