Class Solution
java.lang.Object
g0401_0500.s0472_concatenated_words.Solution
472 - Concatenated Words.<p>Hard</p>
<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 in the given array.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> words = [“cat”,“cats”,“catsdogcats”,“dog”,“dogcatsdog”,“hippopotamuses”,“rat”,“ratcatdogcat”]</p>
<p><strong>Output:</strong> [“catsdogcats”,“dogcatsdog”,“ratcatdogcat”]</p>
<p><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”.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> words = [“cat”,“dog”,“catdog”]</p>
<p><strong>Output:</strong> [“catdog”]</p>
<p><strong>Constraints:</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> consists of only lowercase English letters.</li>
<li><code>0 <= sum(words[i].length) <= 10<sup>5</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
findAllConcatenatedWordsInADict
-