代码:
class Solution {
public int maximalNetworkRank(int n, int[][] roads) {
int max = 0;
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
int r = getR(i,j,roads);
if(r>max)max=r;
}
}
return max;
}
public int getR(int a,int b,int[][]roads){
int r = 0 ;
for(int[] road:roads){
if(road[0]==a||road[0]==b||road[1]==a||road[1]==b){
r++;
}
}
return r;
}
}