mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 19:18:14 +08:00
42 lines
1.5 KiB
HTML
42 lines
1.5 KiB
HTML
|
<p>给定一个字符串 <code>s</code><strong> </strong>和一些 <strong>长度相同</strong> 的单词 <code>words</code><strong> 。</strong>找出 <code>s</code><strong> </strong>中恰好可以由 <code>words</code><strong> </strong>中所有单词串联形成的子串的起始位置。</p>
|
|||
|
|
|
|||
|
|
<p>注意子串要与 <code>words</code><strong> </strong>中的单词完全匹配，<strong>中间不能有其他字符 </strong>，但不需要考虑 <code>words</code><strong> </strong>中单词串联的顺序。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "barfoothefoobarman", words = ["foo","bar"]
|
|||
|
|
<strong>输出：</strong><code>[0,9]</code>
|
|||
|
|
<strong>解释：</strong>
|
|||
|
|
从索引 0 和 9 开始的子串分别是 "barfoo" 和 "foobar" 。
|
|||
|
|
输出的顺序不重要, [9,0] 也是有效答案。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "wordgoodgoodgoodbestword", words = ["word","good","best","word"]
|
|||
|
|
<code><strong>输出：</strong>[]</code>
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "barfoofoobarthefoobarman", words = ["bar","foo","the"]
|
|||
|
|
<strong>输出：</strong>[6,9,12]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= s.length <= 10<sup>4</sup></code></li>
|
|||
|
|
<li><code>s</code> 由小写英文字母组成</li>
|
|||
|
|
<li><code>1 <= words.length <= 5000</code></li>
|
|||
|
|
<li><code>1 <= words[i].length <= 30</code></li>
|
|||
|
|
<li><code>words[i]</code> 由小写英文字母组成</li>
|
|||
|
|
</ul>
|