Class Solution
-
- All Implemented Interfaces:
public final class Solution1376 - Time Needed to Inform All Employees.
Medium
A company has
nemployees with a unique ID for each employee from0ton - 1. The head of the company is the one withheadID.Each employee has one direct manager given in the
managerarray wheremanager[i]is the direct manager of thei-themployee,manager[headID] = -1. Also, it is guaranteed that the subordination relationships have a tree structure.The head of the company wants to inform all the company employees of an urgent piece of news. He will inform his direct subordinates, and they will inform their subordinates, and so on until all employees know about the urgent news.
The
i-themployee needsinformTime[i]minutes to inform all of his direct subordinates (i.e., After informTimei minutes, all his direct subordinates can start spreading the news).Return the number of minutes needed to inform all the employees about the urgent news.
Example 1:
Input: n = 1, headID = 0, manager = -1, informTime = 0
Output: 0
Explanation: The head of the company is the only employee in the company.
Example 2:
Input: n = 6, headID = 2, manager = 2,2,-1,2,2,2, informTime = 0,0,1,0,0,0
Output: 1
Explanation: The head of the company with id = 2 is the direct manager of all the employees in the company and needs 1 minute to inform them all.
The tree structure of the employees in the company is shown.
Constraints:
<code>1 <= n <= 10<sup>5</sup></code>
0 <= headID < nmanager.length == n0 <= manager[i] < nmanager[headID] == -1informTime.length == n0 <= informTime[i] <= 1000informTime[i] == 0if employeeihas no subordinates.It is guaranteed that all the employees can be informed.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-