mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -7,7 +7,7 @@
|
||||
<p><strong>Note:</strong> In all test cases, all words were chosen randomly from the <code>1000</code> most common US English words, and <code>target</code> was chosen as a concatenation of two random words.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> stickers = ["with","example","science"], target = "thehat"
|
||||
@@ -18,7 +18,7 @@ After cutting and rearrange the letters of those stickers, we can form the targe
|
||||
Also, this is the minimum number of stickers necessary to form the target string.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> stickers = ["notice","possible"], target = "basicbasic"
|
||||
|
Reference in New Issue
Block a user