[leetcode]5354. 通知所有员工所需的时间

找到底层员工往上算

class Solution {
public:
    int numOfMinutes(int n, int headID, vector<int>& manager, vector<int>& informTime) {
        int res = 0;
        for(int i = 0; i < n; i++)
        {
            if(informTime[i] != 0) //不是叶子
            {
                continue;
            }
            int cur = i;
            int cost = 0;
            while(manager[cur] != -1)
            {
                cost += informTime[manager[cur]];
                cur = manager[cur];
            }
            res = max(res, cost);
        }
        return res;
    }
};