mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
33 lines
1.2 KiB
HTML
33 lines
1.2 KiB
HTML
|
<p>给你一个 <strong>不含重复 </strong>单词的字符串数组 <code>words</code> ，请你找出并返回 <code>words</code> 中的所有 <strong>连接词</strong> 。</p>
|
|||
|
|
|
|||
|
|
<p><strong>连接词</strong> 定义为：一个完全由给定数组中的至少两个较短单词组成的字符串。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>words = ["cat","cats","catsdogcats","dog","dogcatsdog","hippopotamuses","rat","ratcatdogcat"]
|
|||
|
|
<strong>输出：</strong>["catsdogcats","dogcatsdog","ratcatdogcat"]
|
|||
|
|
<strong>解释：</strong>"catsdogcats" 由 "cats", "dog" 和 "cats" 组成;
|
|||
|
|
"dogcatsdog" 由 "dog", "cats" 和 "dog" 组成;
|
|||
|
|
"ratcatdogcat" 由 "rat", "cat", "dog" 和 "cat" 组成。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>words = ["cat","dog","catdog"]
|
|||
|
|
<strong>输出：</strong>["catdog"]</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= words.length <= 10<sup>4</sup></code></li>
|
|||
|
|
<li><code>0 <= words[i].length <= 1000</code></li>
|
|||
|
|
<li><code>words[i]</code> 仅由小写字母组成</li>
|
|||
|
|
<li><code>0 <= sum(words[i].length) <= 10<sup>5</sup></code></li>
|
|||
|
|
</ul>
|