1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-12 10:51:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

This commit is contained in:
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions

View File

@@ -0,0 +1,44 @@
<p>单词数组&nbsp;<code>words</code><strong>有效编码</strong> 由任意助记字符串 <code>s</code> 和下标数组 <code>indices</code> 组成,且满足:</p>
<ul>
<li><code>words.length == indices.length</code></li>
<li>助记字符串 <code>s</code><code>&#39;#&#39;</code> 字符结尾</li>
<li>对于每个下标 <code>indices[i]</code> <code>s</code> 的一个从 <code>indices[i]</code> 开始、到下一个 <code>&#39;#&#39;</code> 字符结束(但不包括 <code>&#39;#&#39;</code>)的 <strong>子字符串</strong> 恰好与 <code>words[i]</code> 相等</li>
</ul>
<p>给定一个单词数组&nbsp;<code>words</code> ,返回成功对 <code>words</code> 进行编码的最小助记字符串 <code>s</code> 的长度 。</p>
<p>&nbsp;</p>
<p><strong>示例 1</strong></p>
<pre>
<strong>输入:</strong>words = [&quot;time&quot;, &quot;me&quot;, &quot;bell&quot;]
<strong>输出:</strong>10
<strong>解释:</strong>一组有效编码为 s = <code>&quot;time#bell#&quot; 和 indices = [0, 2, 5</code>] 。
words[0] = &quot;time&quot; s 开始于 indices[0] = 0 到下一个 &#39;#&#39; 结束的子字符串,如加粗部分所示 &quot;<strong>time</strong>#bell#&quot;
words[1] = &quot;me&quot; s 开始于 indices[1] = 2 到下一个 &#39;#&#39; 结束的子字符串,如加粗部分所示 &quot;ti<strong>me</strong>#bell#&quot;
words[2] = &quot;bell&quot; s 开始于 indices[2] = 5 到下一个 &#39;#&#39; 结束的子字符串,如加粗部分所示 &quot;time#<strong>bell</strong>#&quot;
</pre>
<p><strong>示例 2</strong></p>
<pre>
<strong>输入:</strong>words = [&quot;t&quot;]
<strong>输出:</strong>2
<strong>解释:</strong>一组有效编码为 s = &quot;t#&quot; 和 indices = [0] 。
</pre>
<p>&nbsp;</p>
<p><strong>提示:</strong></p>
<ul>
<li><code>1 &lt;= words.length &lt;= 2000</code></li>
<li><code>1 &lt;= words[i].length &lt;= 7</code></li>
<li><code>words[i]</code> 仅由小写字母组成</li>
</ul>
<p>&nbsp;</p>
<p><meta charset="UTF-8" />注意:本题与主站 820&nbsp;题相同:&nbsp;<a href="https://leetcode-cn.com/problems/short-encoding-of-words/">https://leetcode-cn.com/problems/short-encoding-of-words/</a></p>