leetcode

0 class Solution {

1 public:

2 int maximalNetworkRank(int n, vector<vector<int>> &roads) {

3 int mat[101][101] = {0}, degree[101] = {0};

4 int res = 0;

5

6 for (int i = 0; i < roads.size(); i++) {

7 int u = roads[i][0], v = roads[i][1];

8 degree[u]++, degree[v]++;

9 mat[u][v] = mat[v][u] = 1;

10 }

11

12 for (int i = 0; i < n; i++) {

13 for (int j = i + 1; j < n; j++) {

14 res = max(res, degree[i] + degree[j] - mat[i][j]);

15 }

16 }

17 return res;

18 }

19 };