1032. Sharing (25)

遍历所有地址  记录被遍历的地址次数 如有大于1的则是第一个相同首地址

#include<vector>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<set>
using namespace std;
#define MAXnum 100005
#define max(a,b) a>b?a:b
struct node{
    int num;
    char c;
    int next;
}a[100001];
int main()
{
    int root1,root2,n;
    scanf("%d%d%d",&root1,&root2,&n);
    int index;

    for(int i=0;i<n;i++)
    {
        scanf("%d",&index);
        scanf(" %c%d",&a[index].c,&a[index].next);
      //  printf("%d%c%d",index,a[index].c,a[index].next);
        a[index].num=0;
    }
    int address=root1;
       while(address!=-1)
       {
           a[address].num++;
           address=a[address].next;
       }
       address=root2;
       int flag=0;
       while(address!=-1)
       {
               a[address].num++;
               if(a[address].num>1)
               {
                   flag=1;
                   break;
               }
           address=a[address].next;
       }
       if(flag)
        printf("%05d\n",address);
       else
        printf("-1\n");


    return 0;
}