PAT 1032 Sharing (25分)

最新推荐文章于 2022-09-19 08:58:30 发布

tina竹

最新推荐文章于 2022-09-19 08:58:30 发布

阅读量147

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/qq_42593220/article/details/104117390

版权

PAT 专栏收录该内容

30 篇文章 0 订阅

订阅专栏

题目：
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).

Input Specification:

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

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.

Output Specification:

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.

Sample Input 1:

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

Sample Output 1:

67890

Sample Input 2:

00001 00002 4
00001 a 10001
10001 s -1
00002 a 10002
10002 t -1

Sample Output 2:

-1

解题思路：
用一个结构体存储结点信息，输入的第一个address为结构体存储的地址。
将第一个单词所用到的全部结点空间标志为已访问过，说明该地址的结点已被存储。
然后从第二个单词的首地址开始遍历，若第二个单词所用到的结点已被访问过，即该地址已被存储，说明第一个单词和第二个单词分享同一个结点空间。

代码如下：

#include<stdio.h>
#include<iostream>
#include<vector>
using namespace std;

struct nodes {
	char data;
	int next;
};
struct nodes node[100001];
bool vis[100001] = { false };
int main() {
	int add1, add2, add, N, addnext;
	char c;
	int n1, n2;
	scanf("%d%d%d", &add1, &add2, &N);
	for (int i = 0; i < N; i++) {
		scanf("%d %c %d", &add,&c,&addnext);
		node[add].data = c;
		node[add].next = addnext;
	}
	n1 = add1;
	while (n1 != -1) {
		vis[n1] = true;
		n1 = node[n1].next;
	}
	n2 = add2;
	int flag = 0;
	while (! flag && n2 != -1) {
		if (vis[n2]) {
			printf("%05d", n2);
			flag = 1;
			break;
		}
		n2 = node[n2].next;
	}
	if (!flag)
		printf("-1");
	
}