-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLC_1125.java
58 lines (49 loc) · 2.08 KB
/
LC_1125.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
package leetcode;
import java.util.*;
import java.util.stream.Collectors;
class LC_1125 {
public int[] smallestSufficientTeam(String[] req_skills,
List<List<String>> people) {
Map<String, Integer> skillIdxMp = new HashMap<>();
int currNeedBitMp = 0;
for(int i=0;i<req_skills.length;i++) {
skillIdxMp.put(req_skills[i], i);
currNeedBitMp |= 1 << i;
}
List<Integer>[][] dp = new ArrayList[people.size()][(int)Math.pow(2,16)+1];
return solve(0, currNeedBitMp, skillIdxMp, people, dp);
}
int[] solve(int idx, int currNeedBitMp,
Map<String, Integer> skillIdxMp, List<List<String>> people, List<Integer>[][] dp) {
if(currNeedBitMp == 0) return new int[0];
if(idx >= people.size()) {
int[] invalidRet = new int[1];
invalidRet[0] = -1;
return invalidRet;
}
if(dp[idx][currNeedBitMp] != null) {
return dp[idx][currNeedBitMp].stream().mapToInt(i->i).toArray();
}
int[] ret = solve(idx+1, currNeedBitMp, skillIdxMp, people, dp);
List<String> skills = people.get(idx);
int nextNeedBitMp = currNeedBitMp;
for(String skill : skills) {
int idxOfSkill = skillIdxMp.get(skill);
nextNeedBitMp &= ~(1 << idxOfSkill);
}
if(currNeedBitMp != nextNeedBitMp) {
int[] addedRet = solve(idx + 1, nextNeedBitMp, skillIdxMp, people, dp);
int[] newAddedRet = new int[addedRet.length+1];
newAddedRet[0] = idx;
for(int i=0;i<addedRet.length;i++) {
newAddedRet[i+1] = addedRet[i];
}
if(newAddedRet[newAddedRet.length-1] != -1) {
if(newAddedRet.length < ret.length || (ret.length >= 1 && ret[ret.length-1] == -1))
ret = newAddedRet;
}
}
dp[idx][currNeedBitMp] = Arrays.stream(ret).boxed().collect(Collectors.toList());
return ret;
}
}