mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
62 lines
2.5 KiB
HTML
62 lines
2.5 KiB
HTML
|
<p>You are given an array of strings <code>words</code> and a string <code>target</code>.</p>
|
||
|
|
|
||
|
|
<p>A string <code>x</code> is called <strong>valid</strong> if <code>x</code> is a <span data-keyword="string-prefix">prefix</span> of <strong>any</strong> string in <code>words</code>.</p>
|
||
|
|
|
||
|
|
<p>Return the <strong>minimum</strong> number of <strong>valid</strong> strings that can be <em>concatenated</em> to form <code>target</code>. If it is <strong>not</strong> possible to form <code>target</code>, return <code>-1</code>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong class="example">Example 1:</strong></p>
|
||
|
|
|
||
|
|
<div class="example-block">
|
||
|
|
<p><strong>Input:</strong> <span class="example-io">words = ["abc","aaaaa","bcdef"], target = "aabcdabc"</span></p>
|
||
|
|
|
||
|
|
<p><strong>Output:</strong> <span class="example-io">3</span></p>
|
||
|
|
|
||
|
|
<p><strong>Explanation:</strong></p>
|
||
|
|
|
||
|
|
<p>The target string can be formed by concatenating:</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>Prefix of length 2 of <code>words[1]</code>, i.e. <code>"aa"</code>.</li>
|
||
|
|
<li>Prefix of length 3 of <code>words[2]</code>, i.e. <code>"bcd"</code>.</li>
|
||
|
|
<li>Prefix of length 3 of <code>words[0]</code>, i.e. <code>"abc"</code>.</li>
|
||
|
|
</ul>
|
||
|
|
</div>
|
||
|
|
|
||
|
|
<p><strong class="example">Example 2:</strong></p>
|
||
|
|
|
||
|
|
<div class="example-block">
|
||
|
|
<p><strong>Input:</strong> <span class="example-io">words = ["abababab","ab"], target = "ababaababa"</span></p>
|
||
|
|
|
||
|
|
<p><strong>Output:</strong> <span class="example-io">2</span></p>
|
||
|
|
|
||
|
|
<p><strong>Explanation:</strong></p>
|
||
|
|
|
||
|
|
<p>The target string can be formed by concatenating:</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>Prefix of length 5 of <code>words[0]</code>, i.e. <code>"ababa"</code>.</li>
|
||
|
|
<li>Prefix of length 5 of <code>words[0]</code>, i.e. <code>"ababa"</code>.</li>
|
||
|
|
</ul>
|
||
|
|
</div>
|
||
|
|
|
||
|
|
<p><strong class="example">Example 3:</strong></p>
|
||
|
|
|
||
|
|
<div class="example-block">
|
||
|
|
<p><strong>Input:</strong> <span class="example-io">words = ["abcdef"], target = "xyz"</span></p>
|
||
|
|
|
||
|
|
<p><strong>Output:</strong> <span class="example-io">-1</span></p>
|
||
|
|
</div>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= words.length <= 100</code></li>
|
||
|
|
<li><code>1 <= words[i].length <= 5 * 10<sup>4</sup></code></li>
|
||
|
|
<li>The input is generated such that <code>sum(words[i].length) <= 10<sup>5</sup></code>.</li>
|
||
|
|
<li><code>words[i]</code> consists only of lowercase English letters.</li>
|
||
|
|
<li><code>1 <= target.length <= 5 * 10<sup>4</sup></code></li>
|
||
|
|
<li><code>target</code> consists only of lowercase English letters.</li>
|
||
|
|
</ul>
|