1032 链表

用结构体储存链表

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
using namespace std;

struct Node{
    char c;
    int next;
    bool flag;
}node[100005];
int main(){
    int n,a,b,s1,s2;
    char cc;
    scanf("%d%d%d",&s1,&s2,&n);
    for(int i=0;i<n;i++){
        cin>>a>>cc>>b;
        node[a].c=cc;
        node[a].next=b;
    }
    for(int i=s1;i!=-1;i=node[i].next)
        node[i].flag=true;
    for(int i=s2;i!=-1;i=node[i].next)
        if(node[i].flag == true) {
            printf("%05d", i);
            return 0;
        }
    cout<<"-1";
    return 0;
}