PAT 甲级 1032 Sharing (25 分)

题目描述

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 ($\le 10^5$), 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
whereAddress 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.

思路

先遍历第一个，给所有地址标1，之后遍历第二个遇到有标1的地方即为答案。

代码

#include<iostream>
#include<cstdio>
#include<stdlib.h>
#include<string.h>
using namespace std;
typedef struct node {
	int next=-1;
	int flag = 0;
}WORD;
WORD words[100000];
int main()
{
	int s1, s2, N;
	cin >> s1 >> s2 >> N;
	for (int i = 0; i < N; i++)
	{
		int cur, ne;
		char c;
		cin >> cur >> c >> ne;
		words[cur].next = ne;
	}
	int p = s1;
	while (words[p].next != -1)
	{
		words[p].flag++;
		p = words[p].next;
	}
	p = s2;
	while (words[p].next != -1)
	{
		if (words[p].flag == 1) {
			printf("%05d\n", p);
			return 0;
		}
		p = words[p].next;
	}
	
	printf("-1\n");
	return 0;
}