1 Star 0 Fork 0

徐长贺/Leetcode

加入 Gitee
与超过 1400万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
_690.java 1.90 KB
一键复制 编辑 原始数据 按行查看 历史
stevesun 提交于 2017-09-29 23:41 +08:00 . [N-0] add 690
package com.fishercoder.solutions;
import com.fishercoder.common.classes.Employee;
import java.util.List;
import java.util.stream.Collectors;
/**
* 690. Employee Importance
*
* You are given a data structure of employee information, which includes the employee's unique id,
* his importance value and his direct subordinates' id.
* For example, employee 1 is the leader of employee 2, and employee 2 is the leader of employee 3.
* They have importance value 15, 10 and 5, respectively.
* Then employee 1 has a data structure like [1, 15, [2]], and
* employee 2 has [2, 10, [3]], and employee 3 has [3, 5, []].
* Note that although employee 3 is also a subordinate of employee 1, the relationship is not direct.
* Now given the employee information of a company, and an employee id,
* you need to return the total importance value of this employee and all his subordinates.
Example 1:
Input: [[1, 5, [2, 3]], [2, 3, []], [3, 3, []]], 1
Output: 11
Explanation:
Employee 1 has importance value 5, and he has two direct subordinates: employee 2 and employee 3.
They both have importance value 3. So the total importance value of employee 1 is 5 + 3 + 3 = 11.
Note:
One employee has at most one direct leader and may have several subordinates.
The maximum number of employees won't exceed 2000.
*/
public class _690 {
public static class Solution1 {
int total = 0;
public int getImportance(List<Employee> employees, int id) {
Employee manager = employees.stream().filter(e -> e.id == id).collect(Collectors.toList()).get(0);
total += manager.importance;
manager.subordinates.forEach(subId -> getImportance(employees, subId));
/**The above line is equivalent to below for loop*/
// for (int subId : manager.subordinates) {
// getImportance(employees, subId);
// }
return total;
}
}
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/isulong/Leetcode.git
git@gitee.com:isulong/Leetcode.git
isulong
Leetcode
Leetcode
master

搜索帮助