代码拉取完成,页面将自动刷新
# Time: O(T * S^T)
# Space: O(T * S^T)
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)
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。