poj1208（链表

#include <iostream>
#include <string>
using namespace std;
struct LNode
{
int data;
LNode* fron;
LNode* next;
};
void change(LNode* addr)
{
LNode* last_addr = addr;
while(addr->next != NULL)
{
addr = addr->next;
last_addr->next = NULL;
addr->fron = NULL;
last_addr = addr;
}
}
bool text(LNode* a,LNode* b)
{
LNode* addr = a;
while(addr != NULL)
if(addr->data == b->data)
return true;
else addr = addr->next;
addr = a;
while(addr != NULL)
if(addr->data == b->data)
return true;
else addr = addr->fron;
return false;
}
int main()
{
int num,n1,n2;
LNode nums[30];
string a,b;
cin >> num;
for(int m = 0;m < num;m++)
{
nums[m].data = m;
nums[m].next = NULL;
nums[m].fron = NULL;
}
while(cin >> a && a != "quit" && cin >> n1 >> b >> n2)
if(!text(&nums[n1],&nums[n2]))
{
LNode* addr = nums[n1].fron;
if(addr != NULL)
addr->next = NULL;
if(a == "move")
{
if(b == "onto")
{
change(&nums[n1]);
change(&nums[n2]);
nums[n1].fron = &nums[n2];
nums[n2].next = &nums[n1];
}
else
{
change(&nums[n1]);
LNode* addr = &nums[n2];
while(addr->next != NULL)
addr = addr->next;
addr->next = &nums[n1];
nums[n1].fron = addr;
}
}
else
{
if(b == "onto")
{
change(&nums[n2]);
nums[n2].next = &nums[n1];
nums[n1].fron = &nums[n2];
}
else
{
LNode* addr = &nums[n2];
while(addr->next != NULL)
addr = addr->next;
addr->next = &nums[n1];
nums[n1].fron = &nums[n2];
}
}

}
for(int m = 0;m < num;m++)
{
cout << m << ':';
if(nums[m].fron == NULL)
{
LNode* addr = &nums[m];
while(addr != NULL)
{
cout << ' ' << addr->data;
addr = addr->next;
}
}
cout << endl;
}
return 0;
}