PAT A1032 Sharing

最新推荐文章于 2022-01-13 21:31:53 发布

啥也不会的炼丹师

最新推荐文章于 2022-01-13 21:31:53 发布

阅读量89

点赞数

本文链接：https://blog.csdn.net/weixin_43370733/article/details/103802374

版权

Description：

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^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

where $\color{red}{Address}$ is the position of the node, $\color{red}{Data}$ is the letter contained by this node which is an English letter chosen from { a-z, A-Z }, and $\color{red}{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

注意点

如果输入起始地址中包含-1，直接输出-1，并返回
输出结果如果非-1，那么需要输出5位数字，使用%05d表示输出5位数，高位不足用0代替；输出结果如果是-1，那么直接输出-1
判断完gap正负之后，将gap转为非负数
while循环时，要注意更改循环变量，不然将会死循环
Node table[maxn];其中table为Node*型变量

AC代码

#include <stdio.h>
#include <string.h>
#include <math.h>

typedef struct Node
{
    char data;
    int next;
}Node;

Node table[100000];//table 就代表Node*型指针

int LenofLinklist(int address)
{//给出起始地址计算长度
    int count=1;
    while(table[address].next!=-1)
    {
        address=table[address].next;
        count++;
    }
    return count;
}

int main()
{
    //freopen("input.txt","r",stdin);
    int ad1,ad2,N,i;
    int len1,len2,gap;
    char b;
    int a,c;
    int longad,shortad;
    scanf("%d %d %d",&ad1,&ad2,&N);
    if(ad1==-1||ad2==-1)
    {
        printf("-1");
        return 0;
    }
    for(i=0;i<N;i++)
    {
        scanf("%d %c %d",&a,&b,&c);
        table[a].data=b;
        table[a].next=c;
    }
    len1=LenofLinklist(ad1);
    len2=LenofLinklist(ad2);
    gap=len1-len2;
    if(gap>0)
    {
        longad=ad1;
        shortad=ad2;
    }
    else
    {
        longad=ad2;
        shortad=ad1;
        gap=-gap;//gap<=0,转为非负数
    }
    while(gap>0)
    {
        longad=table[longad].next;
        gap--;//记得加该语句，不然死循环
    }
    while(1)
    {
        if(longad==shortad)break;
        longad=table[longad].next;
        shortad=table[shortad].next;
    }
    if(longad!=-1)printf("%05d",longad);
    else printf("-1");
}