Sharing（又是链表

找两个链表的公共后缀的第一个字符的地址
对于怎样处理链表类的题目，大概建一个结构体是比较方便的，定好一个表头，然后一直找next找到等于-1就可以了
题目描述
To store English words, one method is to use linked lists and store a
word letter by letter. To save some space, we may let the words share
the same sublist if they share the same suffix. For example,
“loading” and “being” are stored as showed in Figure
1.

Figure 1 You are supposed to find the starting position of the common
suffix (e.g. the position of “i” in Figure 1).

输入描述:
Each input file contains one test case. For each case, the first line contains two addresses of nodes and a positive N (<= 105), where the two addresses are the addresses of the first nodes of the two words, and N is the total number of nodes. The address of a node is a 5-digit positive integer, and NULL is represented by -1.
Then N lines follow, each describes a node in the format:
Address Data Next
where Address is the position of the node, Data is the letter contained by this node which is an English letter chosen from {a-z, A-Z}, and Next is the position of the next node.

输出描述:
For each case, simply output the 5-digit starting position of the common suffix. If the two words have no common suffix, output “-1” instead.

输入例子:
11111 22222 9
67890 i 00002
00010 a 12345
00003 g -1
12345 D 67890
00002 n 00003
22222 B 23456
11111 L 00001
23456 e 67890
00001 o 00010

输出例子:
67890

#include<bits/stdc++.h>
#include <iostream> 
#include <map>
#include <string>
#include<vector>
#include<stack> 
using namespace std;	
struct node{
	int add;
	char word;
	int nxt;
}node[100005];

int main()
{
	int st1,st2;
	cin>>st1>>st2;
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		int add,nxt;
		char wo;
		cin>>add>>wo>>nxt;
		node[add].word=wo;
		node[add].nxt=nxt;
		node[add].add=add;
	}
	
	int len1=0,len2=0,s=st1;
	while(s!=-1)
	{
		len1++;
		s=node[s].nxt;
	}
	s=st2;
	while(s!=-1)
	{
		len2++;
		s=node[s].nxt;
	}
	
	if(len1>len2)
	{
	int len=len1-len2;
	while(len--)
	{
		st1=node[st1].nxt;
	}	
	}
	else
	{
	int len=len2-len1;
	while(len--)
	{
		st2=node[st2].nxt;
	}	
	}
	
	while(st1>=0&&st2>=0&&st1!=st2)
	{
		st1=node[st1].nxt;
		st2=node[st2].nxt;
	}
	if(st1>=0)printf("%05d",node[st1].add);
	else cout<<-1;
	return 0;
 }