mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
32 lines
1.7 KiB
HTML
32 lines
1.7 KiB
HTML
<p>Given an array of strings <code>words</code> (<strong>without duplicates</strong>), return <em>all the <strong>concatenated words</strong> in the given list of</em> <code>words</code>.</p>
|
|
|
|
<p>A <strong>concatenated word</strong> is defined as a string that is comprised entirely of at least two shorter words (not necessarily distinct) in the given array.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> words = ["cat","cats","catsdogcats","dog","dogcatsdog","hippopotamuses","rat","ratcatdogcat"]
|
|
<strong>Output:</strong> ["catsdogcats","dogcatsdog","ratcatdogcat"]
|
|
<strong>Explanation:</strong> "catsdogcats" can be concatenated by "cats", "dog" and "cats";
|
|
"dogcatsdog" can be concatenated by "dog", "cats" and "dog";
|
|
"ratcatdogcat" can be concatenated by "rat", "cat", "dog" and "cat".</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> words = ["cat","dog","catdog"]
|
|
<strong>Output:</strong> ["catdog"]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= words.length <= 10<sup>4</sup></code></li>
|
|
<li><code>1 <= words[i].length <= 30</code></li>
|
|
<li><code>words[i]</code> consists of only lowercase English letters.</li>
|
|
<li>All the strings of <code>words</code> are <strong>unique</strong>.</li>
|
|
<li><code>1 <= sum(words[i].length) <= 10<sup>5</sup></code></li>
|
|
</ul>
|