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

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
leetcode-cn/problem (Chinese)/拼写单词 [find-words-that-can-be-formed-by-characters].html
View File

@@ -10,26 +10,28 @@
<p><strong>示例 1：</strong></p>
<pre><strong>输入：</strong>words = [&quot;cat&quot;,&quot;bt&quot;,&quot;hat&quot;,&quot;tree&quot;], chars = &quot;atach&quot;
<pre>
<strong>输入：</strong>words = ["cat","bt","hat","tree"], chars = "atach"
<strong>输出：</strong>6
<strong>解释： </strong>
可以形成字符串 &quot;cat&quot; 和 &quot;hat&quot;，所以答案是 3 + 3 = 6。
可以形成字符串 "cat" 和 "hat"，所以答案是 3 + 3 = 6。
</pre>
<p><strong>示例 2：</strong></p>
<pre><strong>输入：</strong>words = [&quot;hello&quot;,&quot;world&quot;,&quot;leetcode&quot;], chars = &quot;welldonehoneyr&quot;
<pre>
<strong>输入：</strong>words = ["hello","world","leetcode"], chars = "welldonehoneyr"
<strong>输出：</strong>10
<strong>解释：</strong>
可以形成字符串 &quot;hello&quot; 和 &quot;world&quot;，所以答案是 5 + 5 = 10。
可以形成字符串 "hello" 和 "world"，所以答案是 5 + 5 = 10。
</pre>
<p>&nbsp;</p>
<p><strong>提示：</strong></p>
<ol>
<ul>
<li><code>1 &lt;= words.length &lt;= 1000</code></li>
<li><code>1 &lt;= words[i].length, chars.length&nbsp;&lt;= 100</code></li>
<li>所有字符串中都仅包含小写英文字母</li>
</ol>
</ul>