leetcode

0 class Solution {

1 public:

2 int edgeScore(vector<int> &edges) {

3 vector<long long> score(edges.size(), 0);

4 long long maxi = LONG_MIN;

5 int index = -1;

6

7 for (int i = 0; i < edges.size(); i++) {

8 score[edges[i]] += i;

9 if (score[edges[i]] > maxi) {

10 maxi = score[edges[i]];

11 index = edges[i];

12 } else if (score[edges[i]] == maxi)

13 index = min(index, edges[i]);

14 }

15

16 return index;

17 }

18 };