Package g0601_0700.s0648_replace_words

Class Solution

java.lang.Object
g0601_0700.s0648_replace_words.Solution
public class Solution extends Object
648 - Replace Words.<p>Medium</p> <p>In English, we have a concept called <strong>root</strong> , which can be followed by some other word to form another longer word - let&rsquo;s call this word <strong>successor</strong>. For example, when the <strong>root</strong> <code>&quot;an&quot;</code> is followed by the <strong>successor</strong> word <code>&quot;other&quot;</code>, we can form a new word <code>&quot;another&quot;</code>.</p> <p>Given a <code>dictionary</code> consisting of many <strong>roots</strong> and a <code>sentence</code> consisting of words separated by spaces, replace all the <strong>successors</strong> in the sentence with the <strong>root</strong> forming it. If a <strong>successor</strong> can be replaced by more than one <strong>root</strong> , replace it with the <strong>root</strong> that has <strong>the shortest length</strong>.</p> <p>Return <em>the <code>sentence</code></em> after the replacement.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> dictionary = [&ldquo;cat&rdquo;,&ldquo;bat&rdquo;,&ldquo;rat&rdquo;], sentence = &ldquo;the cattle was rattled by the battery&rdquo;</p> <p><strong>Output:</strong> &ldquo;the cat was rat by the bat&rdquo;</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> dictionary = [&ldquo;a&rdquo;,&ldquo;b&rdquo;,&ldquo;c&rdquo;], sentence = &ldquo;aadsfasf absbs bbab cadsfafs&rdquo;</p> <p><strong>Output:</strong> &ldquo;a a b c&rdquo;</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= dictionary.length <= 1000</code></li> <li><code>1 <= dictionary[i].length <= 100</code></li> <li><code>dictionary[i]</code> consists of only lower-case letters.</li> <li><code>1 <= sentence.length <= 10<sup>6</sup></code></li> <li><code>sentence</code> consists of only lower-case letters and spaces.</li> <li>The number of words in <code>sentence</code> is in the range <code>[1, 1000]</code></li> <li>The length of each word in <code>sentence</code> is in the range <code>[1, 1000]</code></li> <li>Every two consecutive words in <code>sentence</code> will be separated by exactly one space.</li> <li><code>sentence</code> does not have leading or trailing spaces.</li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details