PAT 1003 Sharing (25)
2015-06-06 09:07
507 查看
题目描述
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).
输入描述:
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 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.
输出描述:
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.
输入例子:
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
输出例子:
67890
//最初的解法低效,且有未知错误 /*思路如下: 从最后面开始找,直到存在某个前驱有不止一个后继指向它,则结束*/ #include <iostream> #include <iomanip> using namespace std; typedef struct Node { int addressPre,addressPost; char data; }; int main() { int a1,a2,N,i,j,k,ans; while(cin>>a1>>a2>>N) { Node *node=new Node ; for(i=0;i<N;i++) cin>>node[i].addressPre>>node[i].data>>node[i].addressPost; /* for(i=0;i<N;i++) cout<<node[i].addressPre<<" "<<node[i].data<<" "<<node[i].addressPost<<endl; */ k=-1; while(1) { ans=0; for(i=0;i<N;i++) { if(k==node[i].addressPost) { ans++; j=i; } } if(ans>1) break; else k=node[j].addressPre; } cout <<setfill('0')<< setw(5)<<k<<endl; } return 0; }
正解
#include <iostream> #include <iomanip> #include <vector> using namespace std; typedef struct Node { int addressPre,addressPost; char data; }; vector<Node> list1; vector<Node> list2; Node node[100010]; int main() { int a1,a2,N,i,j,k; int l1,l2; Node tNode; while(cin>>a1>>a2>>N) { for(i=0;i<N;i++) { cin>>tNode.addressPre>>tNode.data>>tNode.addressPost; node[tNode.addressPre]=tNode; } l1=a1; l2=a2; while(l1!=-1) { list1.push_back(node[l1]); l1=node[l1].addressPost; } while(l2!=-1) { list2.push_back(node[l2]); l2=node[l2].addressPost; } for(i=0,k=0;i<list1.size();i++) { for(j=0;j<list2.size();j++) { if(list1[i].addressPre==list2[j].addressPre) { k=1; break; } } if(k) break; } if(k) cout <<setfill('0')<< setw(5)<<list1[i].addressPre<<endl; else cout<<-1<<endl; } return 0; }
相关文章推荐
- 使用C++实现JNI接口需要注意的事项
- 关于指针的一些事情
- c++ primer 第五版 笔记前言
- share_ptr的几个注意点
- Lua教程(一):在C++中嵌入Lua脚本
- Lua教程(二):C++和Lua相互传递数据示例
- C++联合体转换成C#结构的实现方法
- C++编写简单的打靶游戏
- C++变位词问题分析
- C/C++数据对齐详细解析
- C++基于栈实现铁轨问题
- C++中引用的使用总结
- C++中调用Lua函数实例
- Lua和C++的通信流程代码实例
- C与C++之间相互调用实例方法讲解
- C++中拷贝构造函数的应用详解
- C++中引用(&)的用法与应用实例分析
- C++使用CriticalSection实现线程同步实例
- C++智能指针实例详解
- 解析C++ 浮点数的格式化输出