6.2 移动小球

今天做了一个双向链表，模拟移动小球的情况。

A  x  y 为将小球x移动到小球y左边，而B  x  y为将小球x移动到y右边，代码如下，但执行效率特别慢，还不如数组模拟快，这也是唯一遗憾的地方

#include <stdlib.h>

#include <stdio.h>

#include <time.h>
#define LOCAL
struct ball{
struct ball* pro;
int num;
struct ball* next;
};
struct ball* creat(int n)
{
struct ball* p1,* p2,*p3,*head;
head=(struct ball *)malloc(sizeof(struct ball));
head->num=0;
head->pro=NULL;
p3=head;
p1=p2=(struct ball *)malloc(sizeof(struct ball));
p2->num=1;
p3->next=p2;
for(int i=0;i<n-1;i++)
{
p1=(struct ball *)malloc(sizeof(struct ball));
p1->num=i+2;
p2->next=p1;
p2->pro=p3;
p3=p2;
p2=p1;
}
p1=(struct ball *)malloc(sizeof(struct ball));
p1->num=0;
p1->next=NULL;
p1->next=p2;
p2->next=p1;
p2->pro=p3;
return head;
}
void print(struct ball*head)
{
struct ball * p1;
p1=head->next;
while(p1->num!=0)
{
struct ball *temp;
temp=p1;
printf("%d ",p1->num);
p1=temp->next;
}
}
struct ball * find(int number,struct ball *head)
{
struct ball * p1;
p1=head->next;
while(p1->num!=0)
{
struct ball *temp;
temp=p1;
if(p1->num==number)
return p1;
p1=temp->next;
}
return NULL;
}
int main(int argc, char *argv[])
{
#ifdef LOCAL
freopen("data.in","r",stdin);
#endif
struct ball*head;
int num,times;
scanf("%d  %d",&num,&times);
getchar();
head=creat(num);
for(int i=0;i<times;i++)
{
   char ctrl;
   int n1,n2;
   struct ball *p1,*p2;
   struct ball *_pro,*_next,*_temp;
scanf("%c  %d  %d",&ctrl,&n1,&n2);
getchar();
switch(ctrl)
{
case 'A':
{
p1=find(n1,head);
p2=find(n2,head);
_pro=p1->pro;
_next=p1->next;
_next->pro=_pro;
_pro->next=_next;
_temp=p2->pro;
p1->pro=_temp;
p1->next=p2;
p2->pro=p1;
_temp->next=p1;
break;
}
case 'B':
{
p1=find(n1,head);
p2=find(n2,head);
_pro=p1->pro;
_next=p1->next;
_next->pro=_pro;
_pro->next=_next;
_temp=p2->next;
p1->next=_temp;
p1->pro=p2;
p2->next=p1;
_temp->pro=p1;
break;
}
}
}
print(head);
printf("\nTIME USED=%.21f\n",(double)clock()/CLOCKS_PER_SEC);
return 0;

}