-
Notifications
You must be signed in to change notification settings - Fork 0
/
solution.py
35 lines (34 loc) · 998 Bytes
/
solution.py
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
class Solution:
def wordSubsets(self, A: List[str], B: List[str]) -> List[str]:
val = dict()
for b in B:
val2 = dict()
for x in b:
if x in val2:
val2[x] += 1
else:
val2[x] = 1
for x in val2.keys():
if x in val:
val[x] = max(val[x],val2[x])
else:
val[x] = val2[x]
ans = list()
for a in A:
val2 = dict()
for x in a:
if x in val2:
val2[x] += 1
else:
val2[x] = 1
flag = 0
for x in val.keys():
if x not in val2:
flag = 1
break
if val2[x] < val[x]:
flag = 1
break
if flag == 0:
ans.append(a)
return ans