zoukankan      html  css  js  c++  java
  • 936. Stamping The Sequence

    You want to form a target string of lowercase letters.

    At the beginning, your sequence is target.length '?' marks.  You also have a stamp of lowercase letters.

    On each turn, you may place the stamp over the sequence, and replace every letter in the sequence with the corresponding letter from the stamp.  You can make up to 10 * target.length turns.

    For example, if the initial sequence is "?????", and your stamp is "abc",  then you may make "abc??", "?abc?", "??abc" in the first turn.  (Note that the stamp must be fully contained in the boundaries of the sequence in order to stamp.)

    If the sequence is possible to stamp, then return an array of the index of the left-most letter being stamped at each turn.  If the sequence is not possible to stamp, return an empty array.

    For example, if the sequence is "ababc", and the stamp is "abc", then we could return the answer [0, 2], corresponding to the moves "?????" -> "abc??" -> "ababc".

    Also, if the sequence is possible to stamp, it is guaranteed it is possible to stamp within 10 * target.length moves.  Any answers specifying more than this number of moves will not be accepted.

    Example 1:

    Input: stamp = "abc", target = "ababc"
    Output: [0,2]
    ([1,0,2] would also be accepted as an answer, as well as some other answers.)
    

    Example 2:

    Input: stamp = "abca", target = "aabcaca"
    Output: [3,0,1]
    

    Note:

    1. 1 <= stamp.length <= target.length <= 1000
    2. stamp and target only contain lowercase letters.

    Aproach #1: C++.

    class Solution {
    public:
        vector<int> movesToStamp(string stamp, string target) {
            vector<int> ans;
            vector<int> seen(target.length());
            int total = 0;
            while (total < target.length()) {
                bool found = false;
                for (int i = 0; i <= target.length() - stamp.length(); ++i) {
                    if (seen[i]) continue;
                    int l = unStamp(stamp, target, i);
                    if (l == 0) continue;
                    seen[i] = 1;
                    total += l;
                    ans.push_back(i);
                    found = true;
                }
                if (!found) return {};
            }
            reverse(begin(ans), end(ans));
            return ans;
        }
        
    private:
        int unStamp(const string& stamp, string& target, int s) {
            int l = stamp.length();
            for (int i = 0; i < stamp.length(); ++i) {
                if (target[s+i] == '*')
                    --l;
                else if (target[s+i] != stamp[i])
                    return 0;
            }
            if (l != 0)
                std::fill(begin(target)+s, begin(target)+s+stamp.length(), '*');
            return l;
        }
    };
    

      

    题意:

    给出一个目标字符串和一个“印章”字符串,求出盖印章的位置,使得目标字符串被印章完全覆盖。若不能完全覆盖则返回空。

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    IT学习 程序员 学习网址收藏
    PHP地图上的点文字标注
    php 三种文件下载的实现
    10个免费的jQuery富文本编辑器
    Docker Swarm(四)Volume 数据(挂载)持久化
    Docker Swarm(三)Service(服务)分配策略
    Docker Swarm(二)常用命令
    Docker Swarm(一)集群部署
    Linux——Shell脚本参数传递的2种方法
    Linux——系统时间、开机时间
  • 原文地址:https://www.cnblogs.com/h-hkai/p/10313820.html
Copyright © 2011-2022 走看看