mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
36 lines
1.5 KiB
HTML
36 lines
1.5 KiB
HTML
|
<p>给定字符串 <code>s</code> 和字符串数组 <code>words</code>, 返回 <em><code>words[i]</code> 中是<code>s</code>的子序列的单词个数</em> 。</p>
|
|||
|
|
|
|||
|
|
<p>字符串的 <strong>子序列</strong> 是从原始字符串中生成的新字符串，可以从中删去一些字符(可以是none)，而不改变其余字符的相对顺序。</p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>例如， <code>“ace”</code> 是 <code>“abcde”</code> 的子序列。</li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1:</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入:</strong> s = "abcde", words = ["a","bb","acd","ace"]
|
|||
|
|
<strong>输出:</strong> 3
|
|||
|
|
<strong>解释:</strong> 有三个是 s 的子序列的单词: "a", "acd", "ace"。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>Example 2:</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入: </strong>s = "dsahjpjauf", words = ["ahjpjau","ja","ahbwzgqnuk","tnmlanowax"]
|
|||
|
|
<strong>输出:</strong> 2
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示:</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= s.length <= 5 * 10<sup>4</sup></code></li>
|
|||
|
|
<li><code>1 <= words.length <= 5000</code></li>
|
|||
|
|
<li><code>1 <= words[i].length <= 50</code></li>
|
|||
|
|
<li><code>words[i]</code>和 <font color="#c7254e" face="Menlo, Monaco, Consolas, Courier New, monospace"><span style="font-size: 12.6px; background-color: rgb(249, 242, 244);">s</span></font> 都只由小写字母组成。</li>
|
|||
|
|
</ul>
|
|||
|
|
<span style="display:block"><span style="height:0px"><span style="position:absolute"></span></span></span>
|