class Solution {
public:
int findCenter(vector<vector<int>>& edges) {
int n = edges.size() + 1;
vector<int> indegree(n + 2, 0);

for (auto &it: edges) {
indegree[it[0]]++;
indegree[it[1]]++;
}

for (int i = 1; i <= n; i++) {
if (indegree[i] == n - 1) return i;
}
return 0;
}
};