移动小球链表实现

#include<stdio.h>
const int N=50000;
struct Node
{
int order;
Node *left,*right;
}node
;

void CreateNode(int n)
{
int i;
for(i = 1;i <= n;i++)
{
node[i].order = i;
node[i].right = &node[i+1];
node[i+1].left= &node[i];
}
node[0].left = NULL;
node[0].right = &node[1];
node[1].left = &node[0];
node[i].right = NULL;
}
void A(int x,int y)
{
Node *p = &node[x],*q = &node[y];
p->right->left=p->left;
p->left->right=p->right;
p->right=q;
p->left=q->left;
q->left->right=p;
q->left=p;
}

void B(int x,int y)
{
Node *p = &node[x],*q = &node[y];
p->right->left = p->left;
p->left->right = p->right;
p->left = q;
p->right = q->right;
q->right->left = p;
q->right = p;
}
int main()
{
int n,m;
char cmd;
int x,y;
scanf("%d%d",&n,&m);
CreateNode(n);
while(m--)
{
scanf("%*c%c%d%d",&cmd,&x,&y);
if(cmd == 'A')
A(x,y);
if(cmd == 'B')
B(x,y);
}
Node *l = &node[0];
l = l->right;
while(l->right)
{
printf("%d",l->order);
l = l->right;
}
return 0;
}