forked from shuboc/LeetCode-2
-
Notifications
You must be signed in to change notification settings - Fork 1
/
stickers-to-spell-word.py
78 lines (73 loc) · 2.73 KB
/
stickers-to-spell-word.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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
# Time: O(T * S^T)
# Space: O(T * S^T)
# We are given N different types of stickers. Each sticker has a lowercase English word on it.
#
# You would like to spell out the given target string by cutting individual letters
# from your collection of stickers and rearranging them.
#
# You can use each sticker more than once if you want, and you have infinite quantities of each sticker.
#
# What is the minimum number of stickers that you need to spell out the target?
# If the task is impossible, return -1.
#
# Example 1:
#
# Input:
# ["with", "example", "science"], "thehat"
#
# Output:
# 3
#
# Explanation:
# We can use 2 "with" stickers, and 1 "example" sticker.
# After cutting and rearrange the letters of those stickers, we can form the target "thehat".
# Also, this is the minimum number of stickers necessary to form the target string.
#
# Example 2:
#
# Input:
# ["notice", "possible"], "basicbasic"
#
# Output:
# -1
#
# Explanation:
# We can't form the target "basicbasic" from cutting letters from the given stickers.
#
# Note:
# - stickers has length in the range [1, 50].
# - stickers consists of lowercase English words (without apostrophes).
# - target has length in the range [1, 15], and consists of lowercase English letters.
# - In all test cases, all words were chosen randomly from the 1000 most common US English words,
# and the target was chosen as a concatenation of two random words.
# - The time limit may be more challenging than usual.
# It is expected that a 50 sticker test case can be solved within 35ms on average.
import collections
class Solution(object):
def minStickers(self, stickers, target):
"""
:type stickers: List[str]
:type target: str
:rtype: int
"""
def minStickersHelper(sticker_counts, target, dp):
if "".join(target) in dp:
return dp["".join(target)]
target_count = collections.Counter(target)
result = float("inf")
for sticker_count in sticker_counts:
if sticker_count[target[0]] == 0:
continue
new_target = []
for k in target_count.keys():
if target_count[k] > sticker_count[k]:
new_target += [k]*(target_count[k] - sticker_count[k])
if len(new_target) != len(target):
num = minStickersHelper(sticker_counts, new_target, dp)
if num != -1:
result = min(result, 1+num)
dp["".join(target)] = -1 if result == float("inf") else result
return dp["".join(target)]
sticker_counts = map(collections.Counter, stickers)
dp = { "":0 }
return minStickersHelper(sticker_counts, target, dp)