mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 15:01:40 +08:00
存量题库数据更新
This commit is contained in:
@@ -3,7 +3,7 @@
|
||||
<p>You may assume that no string in <code>words</code> is a substring of another string in <code>words</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> words = ["alex","loves","leetcode"]
|
||||
@@ -11,7 +11,7 @@
|
||||
<strong>Explanation:</strong> All permutations of "alex","loves","leetcode" would also be accepted.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> words = ["catg","ctaagt","gcta","ttca","atgcatc"]
|
||||
|
Reference in New Issue
Block a user