PAT A 1032（甲级）

最新推荐文章于 2024-11-16 16:44:44 发布

CrazyOnes

最新推荐文章于 2024-11-16 16:44:44 发布

阅读量947

点赞数 2

分类专栏： PAT练习题文章标签： PAT PAT甲级算法链表静态链表

本文链接：https://blog.youkuaiyun.com/CrazyOnes/article/details/82458317

版权

这篇博客介绍了PAT(A组)第1032题"Sharing"，涉及如何使用链表存储英文单词并节省空间。文章讨论了如何找到共享后缀的起始位置，并提供了两种解决方法：一种是通过排序和搜索链表节点，另一种是利用节点标记已访问状态。博主分享了两种方法的AC代码，并邀请读者指正错误。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1032 Sharing（25 分）

作者: CHEN, Yue

单位: 浙江大学

时间限制: 200 ms

内存限制: 64 MB

代码长度限制: 16 KB

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 beingare 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 node

最低0.47元/天解锁文章