前置知识
#构造一二维数组
a = [0]*n
b = [[0]*n for _ in range(n)]
例题
代码
# 枚举所有roads,学习这种枚举方法
class Solution:
def maximalNetworkRank(self, n: int, roads: List[List[int]]) -> int:
g = [[0] * n for _ in range(n)]
cnt = [0] * n
for a, b in roads:
g[a][b] = g[b][a] = 1
cnt[a] += 1
cnt[b] += 1
return max(cnt[a] + cnt[b] - g[a][b] for a in range(n) for b in range(a + 1, n))
Comments NOTHING