Maximal Network Rank LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maximalNetworkRank(int n, vector<vector<int>> &roads) {
4
    vector<vector<int>> graph(n, vector<int>(n, 0));
5
    vector<int> degree(n, 0);
6
    for (int i = 0; i < roads.size(); i++) {
7
      int u = roads[i][0];
8
      int v = roads[i][1];
9
      degree[u]++;
10
      degree[v]++;
11
      graph[u][v] = 1;
12
      graph[v][u] = 1;
13
    }
14
    int ans = 0;
15
    for (int i = 0; i < graph.size(); i++) {
16
      for (int j = 0; j < graph.size(); j++) {
17
        if (j != i) {
18
          int rank = degree[i] + degree[j] - graph[i][j];
19
          ans = max(ans, rank);
20
        }
21
      }
22
    }
23
    return ans;
24
  }
25
};