leetcode 691. Stickers to Spell Word

最新推荐文章于 2022-12-18 14:33:31 发布

景行cmy

最新推荐文章于 2022-12-18 14:33:31 发布

阅读量188

点赞数

分类专栏： leetcode 动态规划

本文链接：https://blog.csdn.net/cmy203/article/details/97258965

版权

给定不同类型的贴纸，每张贴纸上有一个小写字母的英文单词。你需要找出拼出给定字符串所需的最少贴纸数量。可以重复使用贴纸，且数量无限。如果无法拼出目标字符串，则返回-1。例如，输入为'stew'时，输出为4。题目具有一定的解题策略，需要凑齐目标字符串的所有字母。

摘要由CSDN通过智能技术生成

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:

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&#

关注

专栏目录