zoukankan      html  css  js  c++  java
  • 691. Stickers to Spell Word

    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.

    Approach #1: DP. [C++]

    class Solution {
    public:
        int minStickers(vector<string>& stickers, string target) {
            int m = stickers.size();
            vector<vector<int>> mp(m, vector<int>(26, 0));
            unordered_map<string, int> dp;
            for (int i = 0; i < m; ++i) {
                for (char c : stickers[i])
                    mp[i][c-'a']++;
            }
            dp[""] = 0;
            return helper(dp, mp, target);
        }
        
    private:
        int helper(unordered_map<string, int>& dp, vector<vector<int>>& mp, string target) {
            if (dp.count(target)) return dp[target];
            int ans = INT_MAX, n = mp.size();
            vector<int> tar(26, 0);
            for (char c : target) tar[c-'a']++;
            for (int i = 0; i < n; ++i) {
                if (mp[i][target[0]-'a'] == 0) continue;
                string s;
                for (int j = 0; j < 26; ++j) 
                    if (tar[j] - mp[i][j] > 0)
                        s += string(tar[j]-mp[i][j], 'a'+j);
                int tmp = helper(dp, mp, s);
                if (tmp != -1) ans = min(ans, 1+tmp);
            }
            dp[target] = ans == INT_MAX ? -1 : ans;
            return dp[target];
        }
    };
    

      

    Analysis:

    https://leetcode.com/problems/stickers-to-spell-word/discuss/108318/C%2B%2BJavaPython-DP-%2B-Memoization-with-optimization-29-ms-(C%2B%2B)

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    299. Bulls and Cows
    Canvas实现文字散粒子化
    jQuery触发a标签点击事件-为什么不跳转
    Java 理论与实践: 正确使用 Volatile 变量
    图片全屏背景 代码实例
    Canvas 唯美雨落代码实现
    开发过程中资源限制的挑战
    死锁
    如何减少并发编程中的上下文切换
    Cookie工具类
  • 原文地址:https://www.cnblogs.com/h-hkai/p/10354309.html
Copyright © 2011-2022 走看看