648. Replace Words

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 rootforming 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:

1. The input will only have lower-case letters.
2. 1 <= dict words number <= 1000
3. 1 <= sentence words number <= 1000
4. 1 <= root length <= 100
5. 1 <= sentence words length <= 1000

public class Solution {
        public String replaceWords(List<String> dict, String sentence) {
        HashSet<String> set=new HashSet<>();
        for(int i=0;i<dict.size();i++){
            set.add(dict.get(i));
        }
        StringBuilder sb=new StringBuilder();
        String[] strs=sentence.split(" ");
        if(strs.length==0||strs.length==1)return sentence;
        for(int i=0;i<strs.length;i++){
            String str=strs[i];
            String temp="";
            for(int j=0;j<str.length();j++){
                temp=temp+str.charAt(j);
                if(set.contains(temp)){
                    strs[i]=temp;
                    break;
                }
            }
        }
        for(int i=0;i<strs.length-1;i++){
            sb.append(strs[i]);
            sb.append(" ");
        }
        sb.append(strs[strs.length-1]);
        return sb.toString();
    }
}