解释:
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.
解释:
一看题目就是经典的dfs。
python代码:
"""
# Employee info
class Employee(object):
def __init__(self, id, importance, subordinates):
# It's the unique id of each node.
# unique id of this employee
self.id = id
# the importance value of this employee
self.importance = importance
# the id of direct subordinates
self.subordinates = subordinates
"""
class Solution(object):
def getImportance(self, employees, id):
"""
:type employees: Employee
:type id: int
:rtype: int
"""
sum=0
for employee in employees:
if id==employee.id:
sum+=employee.importance
for subordinate in employee.subordinates:
sum+=self.getImportance(employees,subordinate)
return sum
/*
// 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 sum=0;
for(auto employee:employees)
{
if (employee->id==id)
{ sum+=employee->importance;
for(auto sub:employee->subordinates)
sum+=getImportance(employees,sub);
}
}
return sum;
}
};
用字典存起来更快一点(为什么别人的代码快但是我的还是一样慢??),dfs最好把字典作为一个形参,这样用c++实现也更方便一点(nonono,突然发现c++也可以用一个全局的变量使得两个函数都可以使用,所以c++也不需要传太多形式参数,哈哈哈哈),dfs函数的形参也可以是dfs(int id,map<>)这样似乎更快一点?
python代码:
"""
"""
# Employee info
class Employee(object):
def __init__(self, id, importance, subordinates):
# It's the unique id of each node.
# unique id of this employee
self.id = id
# the importance value of this employee
self.importance = importance
# the id of direct subordinates
self.subordinates = subordinates
"""
class Solution(object):
def getImportance(self, employees, id):
"""
:type employees: Employee
:type id: int
:rtype: int
"""
def dfs(root,_dict):
if not root:
return 0
return root.importance+sum([dfs(_dict[sub],_dict) for sub in root.subordinates])
_dict={e.id:e for e in employees}
return dfs(_dict[id],_dict)
c++代码:
/*
// 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;
};
*/
#include<map>
using namespace std;
class Solution {
public:
int getImportance(vector<Employee*> employees, int id) {
map<int,Employee*> _map;
for(Employee* employee:employees)
_map[employee->id]=employee;
return dfs(_map[id],_map);
}
int dfs(Employee* root,map<int,Employee*> _map)
{
if(!root)
return 0;
int sum=root->importance;
for (auto sub:root->subordinates)
sum+=dfs(_map[sub],_map);
return sum;
}
};
优化后的c++代码,速度变快很多。
/*
// 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;
};
*/
#include<map>
using namespace std;
class Solution {
public:
map<int,Employee*> _map;
int getImportance(vector<Employee*> employees, int id) {
for(Employee* employee:employees)
_map[employee->id]=employee;
return dfs(id);
}
int dfs(int id)
{
Employee* root=_map[id];
int sum=root->importance;
for (auto sub:root->subordinates)
sum+=dfs(sub);
return sum;
}
};
总结:
因为给的是个类,所以可以申请一个共有变量供所有函数使用,这样传参数的时候就不需要太多形式参数,可以简化代码。才发现c++原来也可以这么搞。