Leetcode 1615. Maximal Network Rank
题目
![在这里插入图片描述](https://img-blog.csdnimg.cn/20201021135212275.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM3ODIxNzAx,size_16,color_FFFFFF,t_70#pic_center)
暴力解法:
class Solution:
def maximalNetworkRank(self, n: int, roads: List[List[int]]) -> int:
graph = collections.defaultdict(int)
for road in roads:
graph[road[0]] += 1
graph[road[1]] += 1
ans = 0
for i in range(n):
for j in range(i+1,n):
tmp = graph[i