Skip to content

Latest commit

 

History

History
67 lines (34 loc) · 1.48 KB

File metadata and controls

67 lines (34 loc) · 1.48 KB

中文文档

Description

In English, we have a concept called root, which can be followed by some other words to form another longer word - let's call this word successor. For example, the root an, followed by other, which can form another word another.

Now, given a dictionary consisting of many roots and a sentence. You need to replace all the successor in the sentence with the root forming it. If a successor has many roots can form it, replace it with the root with the shortest length.

You need to output the sentence after the replacement.

Example 1:

Input: dict = ["cat", "bat", "rat"]

sentence = "the cattle was rattled by the battery"

Output: "the cat was rat by the bat"

 

Note:

    <li>The input will only have lower-case letters.</li>
    
    <li>1 &lt;= dict words number &lt;= 1000</li>
    
    <li>1 &lt;= sentence words number &lt;= 1000</li>
    
    <li>1 &lt;= root length &lt;= 100</li>
    
    <li>1 &lt;= sentence words length &lt;= 1000</li>
    

 

Solutions

Python3

Java

...