建了一个单项链表环...如何将此链表的环反向旋转啊?有答案立即结贴.

[zhiang75]

建了一个链表环...如何将此链表的环反向旋转啊?
结构
struct mr_node
{
int data;
mr_node *next;
};

代码:
mr_node *p1=NULL;

mr_node *p2=NULL;

mr_node *p3=NULL;



p1=(mr_node *)(malloc(sizeof(mr_node)));

p1->data=0;

p2=p1;

p3=p1;

for(int a=1;a<20;a++)

{

p1=(mr_node *)(malloc(sizeof(mr_node)));

p1->data=a;

p2->next=p1;

p2=p1;

}

p1->next=p3;



mr_node mr_array1[20];



int a=0;

p2=p3;

do

{

mr_array1[a]=*p2;



a++;

p2=p2->next;

}while(p2!=p3);





for(int a=0;a<19;a++)

{

mr_array1[a].next=&mr_array1[a-1];

}

mr_array1[19].next=&mr_array1[0];







p2=p3;

do

{ p1=p2;

p2=p2->next;

free(p1);

}while(p2!=p3);

}

不对,请指点.谢谢.

[sharpdew]

// 下面的代码满足你的要求
struct mr_node
{
int data;
mr_node *next;
};

int main()
{
mr_node *p1=NULL;
mr_node *p2=NULL;
mr_node *p3=NULL;

// create a cyclic list
p1=(mr_node *)(malloc(sizeof(mr_node)));
p1->data=0;
p2=p1;
p3=p1;
for(int a=1;a<20;a++)
{
p3 = (mr_node *)(malloc(sizeof(mr_node)));
p3->data = a;
p2->next = p3;
p2 = p3;
}
p2->next = p1;

// print the list
p3 = p1->next;
while(p3 && p3 != p1)
{
cout << p3->data << " ";
p3 = p3->next;
}
cout << endl;

// reverse the cyclic list
p3 = p1->next;
p2 = p1;
while(p3 && p3 != p1)
{
mr_node* tmp = p3->next;
p3->next = p2;
p2 = p3;
p3 = tmp;
}
p1->next = p2;

// print the reversed list
p3 = p1->next;
while(p3 && p3 != p1)
{
cout << p3->data << " ";
p3 = p3->next;
}
cout << endl;



return 0;
}

[zjx95]

void Reverse(mr_node *pCircle)
{
mr_node *p1, *p2, *p3;

p1 = pCircle;
p2 = p1->pNext;
p3 = p2->pNext;
while (1)
{
p2->pNext = p1;

p1 = p2;
p2 = p3;
p3 = p3->pNext;

if (p1 == pCircle)
{
break;
}
}
}

[tailzhou]

#include <iostream>

struct mr_node
{
int data;
mr_node *next;
};

mr_node *p1=NULL;
mr_node *p2=NULL;
mr_node *p3=NULL;

void converse(mr_node *p)
{
mr_node *pa=p->next;
if (pa->next==NULL)
{
pa->next=p;
return;
}
p->next=NULL;
converse(pa);
pa->next=p;
}

int main()
{


p1=(mr_node *)(malloc(sizeof(mr_node)));
p1->data=0;
p2=p1;
p3=p1;
for(int a=1;a<20;a++)
{
p1=(mr_node *)(malloc(sizeof(mr_node)));
p1->data=a;
p2->next=p1;
p2=p1;
}
p1->next=p3;

p1=p3;
p2=p1;
while(p1->next!=p3)
{
p1=p1->next;
printf("->%d",p1->data);
}

printf("\n");

converse(p1);

p1=p3;
p2=p1;
while(true)
{
p1=p1->next;
printf("->%d",p1->data);
}
}