2924. Find Champion II
## 思路
计算indegree
优胜队伍的indegree会是0
如果超过两个队伍的indegree是0就回传-1
## Code
```python
class Solution:
def findChampion(self, n: int, edges: List[List[int]]) -> int:
indegree = [0] * n
for _from, _to in edges:
indegree[_to] += 1
res = None
for i in range(n):
if indegree[i] > 0:
continue
if res is not None:
return -1
res = i
return res
```