Package g0901_1000.s0936_stamping_the_sequence

Class Solution

java.lang.Object

g0901_1000.s0936_stamping_the_sequence.Solution

public class Solution
extends Object

936 - Stamping The Sequence.<p>Hard</p> <p>You are given two strings <code>stamp</code> and <code>target</code>. Initially, there is a string <code>s</code> of length <code>target.length</code> with all <code>s[i] == '?'</code>.</p> <p>In one turn, you can place <code>stamp</code> over <code>s</code> and replace every letter in the <code>s</code> with the corresponding letter from <code>stamp</code>.</p> <ul> <li> <p>For example, if <code>stamp = &quot;abc&quot;</code> and <code>target = &quot;abcba&quot;</code>, then <code>s</code> is <code>&quot;?????&quot;</code> initially. In one turn you can:</p> <ul> <li>place <code>stamp</code> at index <code>0</code> of <code>s</code> to obtain <code>&quot;abc??&quot;</code>,</li> <li>place <code>stamp</code> at index <code>1</code> of <code>s</code> to obtain <code>&quot;?abc?&quot;</code>, or</li> <li>place <code>stamp</code> at index <code>2</code> of <code>s</code> to obtain <code>&quot;??abc&quot;</code>.</li> </ul> <p>Note that <code>stamp</code> must be fully contained in the boundaries of <code>s</code> in order to stamp (i.e., you cannot place <code>stamp</code> at index <code>3</code> of <code>s</code>).</p> </li> </ul> <p>We want to convert <code>s</code> to <code>target</code> using <strong>at most</strong> <code>10 * target.length</code> turns.</p> <p>Return <em>an array of the index of the left-most letter being stamped at each turn</em>. If we cannot obtain <code>target</code> from <code>s</code> within <code>10 * target.length</code> turns, return an empty array.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> stamp = &ldquo;abc&rdquo;, target = &ldquo;ababc&rdquo;</p> <p><strong>Output:</strong> [0,2]</p> <p><strong>Explanation:</strong> Initially s = &ldquo;?????&rdquo;.</p> <ul> <li>Place stamp at index 0 to get &ldquo;abc??&rdquo;.</li> <li>Place stamp at index 2 to get &ldquo;ababc&rdquo;.</li> </ul> <p>[1,0,2] would also be accepted as an answer, as well as some other answers.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> stamp = &ldquo;abca&rdquo;, target = &ldquo;aabcaca&rdquo;</p> <p><strong>Output:</strong> [3,0,1]</p> <p><strong>Explanation:</strong> Initially s = &ldquo;???????&rdquo;.</p> <ul> <li>Place stamp at index 3 to get &ldquo;???abca&rdquo;.</li> <li>Place stamp at index 0 to get &ldquo;abcabca&rdquo;.</li> <li>Place stamp at index 1 to get &ldquo;aabcaca&rdquo;.</li> </ul> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= stamp.length <= target.length <= 1000</code></li> <li><code>stamp</code> and <code>target</code> consist of lowercase English letters.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	movesToStamp(String stamp, String target)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

movesToStamp

public int[] movesToStamp(String stamp,
 String target)