题目描述
链表的练习题,自己对于此类题练习较少,需要在今后多加练习,此题代码量也较大,需要在日后多加练习
#include<cstdio>
struct node{
int size;
node *pre,*post;
node *down;
char a,b;
node():pre(NULL),post(NULL),down(NULL),size(1){
}
};
inline void insertNode(node *&m,node *&n){
n->post=m->post;
n->pre=m->pre;
if(m->post) m->post->pre=n;
if(m->pre) m->pre->post=n;
}
inline void takeoutNode(node *&n){
if(n->down){
node *down=n->down;
insertNode(n,down);
return;
}
if(n->pre) n->pre->post=n->post;
if(n->post) n->post->pre=n->pre;
}
inline void inStackNode(node *&m,node *&n){
n->size=m->size+1;
insertNode(m,n);
n->down=m;
}
inline bool checkMovable(node *&n,node *&m){
return n->a==m->a||n->b==m->b;
}
inline void pre3(node *&n){
if(n->pre) n=n->pre;
if(n->pre) n=n->pre;
if(n->pre) n=n->pre;
}
inline void pre1(node *&n){
if(n->pre) n=n->pre;
}
inline void deleteNode(node *&n){
while(n){
node *p=n->post;
while(n){
node *d=n->down;
delete n;n=NULL;
n=d;
}
n=p;
}
}
int main(){
node *head=new node();
while(true){
node *it=new node();
it->a=getchar();
if(it->a=='#') break;
it->b=getchar();
getchar();
head->post=it;
it->pre=head;
for(int i=1;i<52;i++){
node *p=new node();
p->a=getchar();
p->b=getchar();
getchar();
it->post=p;
p->pre=it;
it=p;
}
bool checkMove=true;
while(checkMove){
checkMove=false;
it=head->post;
while(it){
node *post=it->post;
node *p=it;
pre3(p);
if(p&&p!=head&&checkMovable(p,it)){
checkMove=true;
takeoutNode(it);
inStackNode(p,it);
break;
}
p=it;
pre1(p);
if(p&&p!=head&&checkMovable(p,it)){
checkMove=true;
takeoutNode(it);
inStackNode(p,it);
break;
}
it=post;
}
}
it=head->post;
int piles=0;
while(it){
piles++;
it=it->post;
}
printf("%d piles remaining:",piles);
it=head->post;
while(it){
printf(" %d",it->size);
it=it->post;
}
printf("\n");
delete(head->post);
}
delete head;
return 0;
}