Maximum Total Importance of Roads LeetCode solution in Java

1
class Solution {
2
  public long maximumImportance(int n, int[][] roads) {
3
    long ans = 0, x = 1;
4
    long degree[] = new long[n];
5
    for (int road[] : roads) {
6
      degree[road[0]]++;
7
      degree[road[1]]++;
8
    }
9
    Arrays.sort(degree);
10
    for (long i : degree) ans += i * (x++);
11
    return ans;
12
  }
13
}