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.
思路:把下属放在一个vector中,然后遍历查找和访问
代码1:
/*
// Employee info
class Employee {
public:
// It's the unique ID of each node.
// unique id of this employee
int id;
// the importance value of this employee
int importance;
// the id of direct subordinates
vector<int> subordinates;
};
*/
class Solution {
public:
int getImportance(vector<Employee*> employees, int id) {
int result=0 ;
int i=0;
for(;i<employees.size();i++){
if(employees[i]->id==id){break;}
}
if(employees[i]->id == id){
if(employees[i]->importance==NULL){return result;}
else{result = employees[i]->importance;}
if(employees[i]->subordinates.size()==0){return result;}
else{
//vector<Employee*> subemployees(employees.begin()+1,employees.end());
for(int subid:employees[i]->subordinates){
result += getImportance(employees, subid);
}
}
}
return result;
}
};
代码2:
/*
// Employee info
class Employee {
public:
// It's the unique ID of each node.
// unique id of this employee
int id;
// the importance value of this employee
int importance;
// the id of direct subordinates
vector<int> subordinates;
};
*/
class Solution {
public:
int getImportance(vector<Employee*> employees, int id) {
int res=0;
vector<int> ids;
ids.push_back(id);
while(ids.size()!=0){
int cid=ids.front();
ids.erase(ids.begin());
for(Employee* e:employees){
if(e->id==cid){
res += e->importance;
ids.insert(ids.end(),e->subordinates.begin(),e->subordinates.end());
break;
}
}
}
return res;
}
};
代码3:
/*
// Employee info
class Employee {
public:
// It's the unique ID of each node.
// unique id of this employee
int id;
// the importance value of this employee
int importance;
// the id of direct subordinates
vector<int> subordinates;
};
*/
class Solution {
public:
static bool compare(Employee* e1, Employee* e2){
return e1->id < e2->id;
}
void visit(vector<Employee*> &employee, int id, int& ret){
Employee e;
e.id = id;
auto it = lower_bound(employee.begin(), employee.end(), &e, compare);
ret += (*it)->importance;
for(int i : (*it)->subordinates){
visit(employee, i, ret);
}
}
int getImportance(vector<Employee*> employees, int id) {
int ret = 0;
sort(employees.begin(), employees.end(), compare);
visit(employees, id, ret);
return ret;
}
};