1032. Sharing (25)

最新推荐文章于 2020-06-28 21:48:22 发布

原创最新推荐文章于 2020-06-28 21:48:22 发布 · 124 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#pat

PAT 甲级同时被 2 个专栏收录

97 篇文章

订阅专栏

7‘’数据结构-栈、队列、链表

3 篇文章

订阅专栏

本文介绍了一种算法，该算法通过使用栈来找出两个由链表表示的英文单词中共享后缀的起始位置。输入包含单词的节点地址及数据，并通过比较逆序遍历的节点来确定共有后缀的位置。

1032. Sharing (25)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

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.

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:

Sample Input 2:

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

Sample Output 2:

-1

注意：特别注意5-digit这种格式是05d%

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cmath>

#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>

using namespace std;

struct node
{
    char data;
    int add;
    int next;
    node()
    {
        add=-1;
        next=-1;
    }
};
node cube[100005];

int main()
{
  //  freopen("in.txt","r",stdin);

    int head1,head2,N;
    scanf("%d %d %d",&head1,&head2,&N);
    for(int i=0;i<N;i++)
    {
        int t1,t2,c;
        scanf("%d %c %d",&t1,&c,&t2);
        cube[t1].add=t1;
        cube[t1].next=t2;
        cube[t1].data=c;
    }

    stack<node> s1,s2;
    int p1=head1;
    int p2=head2;
    while(p1!=-1)
    {
        s1.push(cube[p1]);
        p1=cube[p1].next;
    }
    while(p2!=-1)
    {
        s2.push(cube[p2]);
        p2=cube[p2].next;
    }

    int ans=-1;
    while( (!s1.empty()&&!s2.empty())&&(s1.top().add==s2.top().add) )//
    {
        ans=s1.top().add;
        s1.pop();
        s2.pop();
    }

    if(ans==-1)
        printf("%d",ans);
    else
        printf("%05d",ans);


    return 0;
}