1032 Sharing (25 point(s)) - C语言 PAT 甲级

最新推荐文章于 2022-02-25 20:00:37 发布

有三只土豆

最新推荐文章于 2022-02-25 20:00:37 发布

阅读量151

点赞数

分类专栏： PAT 甲级文章标签： PAT 甲级 C

本文链接：https://blog.csdn.net/huaxuewan/article/details/101017177

版权

PAT 甲级专栏收录该内容

155 篇文章 3 订阅

订阅专栏

1032 Sharing (25 point(s))

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 (≤ 10⁵), 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

题目大意：

求两个链表的首个公共节点的地址

设计思路：

首先遍历两个链表得到各自的长度；第二次遍历，先让长的链表走若干步，使剩下的长度和短的链表长度相同；然后，同时在两个链表上遍历，找到第一个相同的节点即第一个公共节点。

但本程序使用了额外的空间，让时间复杂度更极端一点（只是尽可能尝试不同的思路）。先遍历第一条链表，将访问的节点标记，再遍历第二条链表时，遇到的第一个访问过的节点，即为第一个公共节点。

编译器：C (gcc)

#include <stdio.h>

struct node {
        int next;
        int flag;
};

int main(void)
{
        struct node link[100000] = {0};
        int s1, s2, n;
        int i, a, b;
        char ch;

        scanf("%d %d %d", &s1, &s2, &n);
        for (i = 0; i < n; i++) {
                scanf("%d %c %d", &a, &ch, &b);
                link[a].next = b;
        }

        for (i = s1; i != -1; i = link[i].next) {
                link[i].flag = 1;
        }
        for (i = s2; i != -1 && link[i].flag == 0; i = link[i].next) {
                ;
        }

        if (i != -1) {
                printf("%05d", i);
        } else {
                printf("%d", i);
        }

        return 0;
}