LeetCode每日一题：2049. 统计最高分的节点数目

2049. 统计最高分的节点数目

邻接表存图，dfs每次返回子节点的个数，同时统计每个结点的分数，最后遍历返回最高分的个数

const int N = 100010, M = N * 2;
int h[N], e[M], ne[M], idx;
typedef long long LL;
LL n, score[N];
class Solution {
public:
    void add(int a, int b) {
        e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
    }

    int dfs(int u) {
    LL res = 1, cnt = 1;
    for (int i = h[u]; ~i; i = ne[i]) {
        int j = e[i];
        int c = dfs(j);
        if (c) res *= c;
        cnt += c;
    }
    if (u) res *= n - cnt;
    score[u] = res;
    return cnt;
    }
    int countHighestScoreNodes(vector<int>& parents) {
        memset(h, -1, sizeof h);
        idx = 0;
        n = parents.size();
        for (int i = 1; i < n; i ++ )
            add(parents[i], i);
        
        dfs(0);

        LL maxn = 0;
        int ans = 0;
        for (int i = 0; i < n; i ++ )
        {
            if (score[i] > maxn)
            {
                ans = 1, maxn = score[i];
            }
            else if (score[i] == maxn) ans ++ ;
        }
        return ans;
    }
};