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
方法一:
建立一个包含 bool visited
变量的结构体,标记该节点是否被访问,以map<address,node>形式存储每一个结点,使用map[address]
查找结点,但最后只通过了部分
struct node{
string address;
string n_address;
string letter;
bool visited;
node(){
}
node(string ad,string n_ad,string le){
address = ad;
n_address = n_ad;
letter = le;
visited = false;
}
};
int _1032(){
string f_address,s_address;
int numbers;
cin >> f_address >> s_address >> numbers;
map<string,node> node_map;
for(int