-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
690.java
62 lines (60 loc) · 1.82 KB
/
690.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
__________________________________________________________________________________________________
sample 4 ms submission
/*
// Employee info
class Employee {
// It's the unique id of each node;
// unique id of this employee
public int id;
// the importance value of this employee
public int importance;
// the id of direct subordinates
public List<Integer> subordinates;
};
*/
class Solution {
int res = 0;
Employee[] emp = new Employee[20001];
public int getImportance(List<Employee> employees, int id) {
for(Employee employee : employees) emp[employee.id] = employee;
calculateImportance(id);
return res;
}
private void calculateImportance(int id) {
Employee employee = emp[id];
res += employee.importance;
for(Integer sub : employee.subordinates) calculateImportance(sub);
}
}
__________________________________________________________________________________________________
sample 42908 kb submission
/*
// Employee info
class Employee {
// It's the unique id of each node;
// unique id of this employee
public int id;
// the importance value of this employee
public int importance;
// the id of direct subordinates
public List<Integer> subordinates;
};
*/
class Solution {
Map<Integer, Employee> emap = new HashMap<>();
public int getImportance(List<Employee> employees, int id) {
for (Employee e : employees) {
emap.put(e.id, e);
}
return dfs(id);
}
private int dfs(int id) {
Employee emp = emap.get(id);
int ans = emp.importance;
for (int subId: emp.subordinates) {
ans += dfs(subId);
}
return ans;
}
}
__________________________________________________________________________________________________