1125:最小的必要团队
This commit is contained in:
parent
4a798165c4
commit
7d80d9b2bd
105
src/main/java/leetcode/editor/cn/SmallestSufficientTeam.java
Normal file
105
src/main/java/leetcode/editor/cn/SmallestSufficientTeam.java
Normal file
@ -0,0 +1,105 @@
|
||||
////作为项目经理，你规划了一份需求的技能清单 req_skills，并打算从备选人员名单 people 中选出些人组成一个「必要团队」（ 编号为 i 的备选人员
|
||||
// people[i] 含有一份该备选人员掌握的技能列表）。
|
||||
//
|
||||
// 所谓「必要团队」，就是在这个团队中，对于所需求的技能列表 req_skills 中列出的每项技能，团队中至少有一名成员已经掌握。可以用每个人的编号来表示团
|
||||
//队中的成员：
|
||||
//
|
||||
//
|
||||
// 例如，团队 team = [0, 1, 3] 表示掌握技能分别为 people[0]，people[1]，和 people[3] 的备选人员。
|
||||
//
|
||||
//
|
||||
// 请你返回 任一 规模最小的必要团队，团队成员用人员编号表示。你可以按 任意顺序 返回答案，题目数据保证答案存在。
|
||||
//
|
||||
//
|
||||
//
|
||||
// 示例 1：
|
||||
//
|
||||
//
|
||||
//输入：req_skills = ["java","nodejs","reactjs"], people = [["java"],["nodejs"],[
|
||||
//"nodejs","reactjs"]]
|
||||
//输出：[0,2]
|
||||
//
|
||||
//
|
||||
// 示例 2：
|
||||
//
|
||||
//
|
||||
//输入：req_skills = ["algorithms","math","java","reactjs","csharp","aws"], people
|
||||
//= [["algorithms","math","java"],["algorithms","math","reactjs"],["java",
|
||||
//"csharp","aws"],["reactjs","csharp"],["csharp","math"],["aws","java"]]
|
||||
//输出：[1,2]
|
||||
//
|
||||
//
|
||||
//
|
||||
//
|
||||
// 提示：
|
||||
//
|
||||
//
|
||||
// 1 <= req_skills.length <= 16
|
||||
// 1 <= req_skills[i].length <= 16
|
||||
// req_skills[i] 由小写英文字母组成
|
||||
// req_skills 中的所有字符串 互不相同
|
||||
// 1 <= people.length <= 60
|
||||
// 0 <= people[i].length <= 16
|
||||
// 1 <= people[i][j].length <= 16
|
||||
// people[i][j] 由小写英文字母组成
|
||||
// people[i] 中的所有字符串 互不相同
|
||||
// people[i] 中的每个技能是 req_skills 中的技能
|
||||
// 题目数据保证「必要团队」一定存在
|
||||
//
|
||||
//
|
||||
// Related Topics 位运算 数组 动态规划 状态压缩 👍 157 👎 0
|
||||
|
||||
|
||||
package leetcode.editor.cn;
|
||||
|
||||
import java.util.ArrayList;
|
||||
import java.util.Arrays;
|
||||
import java.util.HashMap;
|
||||
import java.util.List;
|
||||
|
||||
// 1125:最小的必要团队
|
||||
public class SmallestSufficientTeam {
|
||||
public static void main(String[] args) {
|
||||
Solution solution = new SmallestSufficientTeam().new Solution();
|
||||
}
|
||||
|
||||
//leetcode submit region begin(Prohibit modification and deletion)
|
||||
class Solution {
|
||||
public int[] smallestSufficientTeam(String[] req_skills, List<List<String>> people) {
|
||||
int n = req_skills.length, m = people.size();
|
||||
HashMap<String, Integer> skill_index = new HashMap<>();
|
||||
for (int i = 0; i < n; ++i) {
|
||||
skill_index.put(req_skills[i], i);
|
||||
}
|
||||
int[] dp = new int[1 << n];
|
||||
Arrays.fill(dp, m);
|
||||
dp[0] = 0;
|
||||
int[] prev_skill = new int[1 << n];
|
||||
int[] prev_people = new int[1 << n];
|
||||
for (int i = 0; i < m; i++) {
|
||||
List<String> p = people.get(i);
|
||||
int cur_skill = 0;
|
||||
for (String s : p) {
|
||||
cur_skill |= 1 << skill_index.get(s);
|
||||
}
|
||||
for (int prev = 0; prev < (1 << n); prev++) {
|
||||
int comb = prev | cur_skill;
|
||||
if (dp[comb] > dp[prev] + 1) {
|
||||
dp[comb] = dp[prev] + 1;
|
||||
prev_skill[comb] = prev;
|
||||
prev_people[comb] = i;
|
||||
}
|
||||
}
|
||||
}
|
||||
List<Integer> res = new ArrayList<>();
|
||||
int i = (1 << n) - 1;
|
||||
while (i > 0) {
|
||||
res.add(prev_people[i]);
|
||||
i = prev_skill[i];
|
||||
}
|
||||
return res.stream().mapToInt(j -> j).toArray();
|
||||
}
|
||||
}
|
||||
//leetcode submit region end(Prohibit modification and deletion)
|
||||
|
||||
}
|
||||
@ -0,0 +1,45 @@
|
||||
<p>作为项目经理，你规划了一份需求的技能清单 <code>req_skills</code>，并打算从备选人员名单 <code>people</code> 中选出些人组成一个「必要团队」（ 编号为 <code>i</code> 的备选人员 <code>people[i]</code> 含有一份该备选人员掌握的技能列表）。</p>
|
||||
|
||||
<p>所谓「必要团队」，就是在这个团队中，对于所需求的技能列表 <code>req_skills</code> 中列出的每项技能，团队中至少有一名成员已经掌握。可以用每个人的编号来表示团队中的成员：</p>
|
||||
|
||||
<ul>
|
||||
<li>例如，团队 <code>team = [0, 1, 3]</code> 表示掌握技能分别为 <code>people[0]</code>，<code>people[1]</code>，和 <code>people[3]</code> 的备选人员。</li>
|
||||
</ul>
|
||||
|
||||
<p>请你返回 <strong>任一</strong> 规模最小的必要团队，团队成员用人员编号表示。你可以按 <strong>任意顺序</strong> 返回答案，题目数据保证答案存在。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>req_skills = ["java","nodejs","reactjs"], people = [["java"],["nodejs"],["nodejs","reactjs"]]
|
||||
<strong>输出：</strong>[0,2]
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 2：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>req_skills = ["algorithms","math","java","reactjs","csharp","aws"], people = [["algorithms","math","java"],["algorithms","math","reactjs"],["java","csharp","aws"],["reactjs","csharp"],["csharp","math"],["aws","java"]]
|
||||
<strong>输出：</strong>[1,2]
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= req_skills.length <= 16</code></li>
|
||||
<li><code>1 <= req_skills[i].length <= 16</code></li>
|
||||
<li><code>req_skills[i]</code> 由小写英文字母组成</li>
|
||||
<li><code>req_skills</code> 中的所有字符串 <strong>互不相同</strong></li>
|
||||
<li><code>1 <= people.length <= 60</code></li>
|
||||
<li><code>0 <= people[i].length <= 16</code></li>
|
||||
<li><code>1 <= people[i][j].length <= 16</code></li>
|
||||
<li><code>people[i][j]</code> 由小写英文字母组成</li>
|
||||
<li><code>people[i]</code> 中的所有字符串 <strong>互不相同</strong></li>
|
||||
<li><code>people[i]</code> 中的每个技能是 <code>req_skills</code> 中的技能</li>
|
||||
<li>题目数据保证「必要团队」一定存在</li>
|
||||
</ul>
|
||||
|
||||
<div><div>Related Topics</div><div><li>位运算</li><li>数组</li><li>动态规划</li><li>状态压缩</li></div></div><br><div><li>👍 157</li><li>👎 0</li></div>
|
||||
Loading…
Reference in New Issue
Block a user