leetcode

0 class Solution {

1 public:

2 int findCenter(vector<vector<int>> &edges) {

3 unordered_set<int> us;

4

5 for (auto &p : edges) {

6 if (us.count(p[0]))

7 return p[0];

8 else

9 us.insert(p[0]);

10 if (us.count(p[1]))

11 return p[1];

12 else

13 us.insert(p[1]);

14 }

15 return -1;

16 }

17 };