Leetcode: Concatenated Words

Given a list of words, please write a program that returns all concatenated words in the given list of words.

A concatenated word is defined as a string that is comprised entirely of at least two shorter words in the given array.

Example:
Input: ["cat","cats","catsdogcats","dog","dogcatsdog","hippopotamuses","rat","ratcatdogcat"]

Output: ["catsdogcats","dogcatsdog","ratcatdogcat"]

Explanation: "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".
Note:
The number of elements of the given array will not exceed 10,000
The length sum of elements in the given array will not exceed 600,000.
All the input string will only include lower case letters.
The returned elements order does not matter.

Scan through array and DP:

We iterate through each word and see if it can be formed by using other words. The subproblem is Word Break I.

But it is a little different from Word Break I, because our result only want words that are concantenated by 2 or more other words in the given array.

How to tell if a word is only by itself in the given array, or it can be concatenated by other words in the given array?

The trick is: it is obvious that a word can only be formed by words shorter than it. So we can first sort the input by length of each word, and only try to form one word by using words in front of it. We also do not add the current word to dictionary when determine if it can be concantenated.

小心一个test case:

Input:[""]

Output:[""]

Expected:[]

如果不加21行那句，就会直接return dp[0], true了

 public class Solution {
     public List<String> findAllConcatenatedWordsInADict(String[] words) {
         List<String> res = new ArrayList<>();
         if (words==null || words.length==0) return res;
         HashSet<String> dict = new HashSet<>();
         Arrays.sort(words, new Comparator<String>() {
             public int compare(String str1, String str2) {
                 return str1.length() - str2.length();
             }
         });

         for (String word : words) {
             if (canForm(word, dict))
                 res.add(word);
             dict.add(word);
         }
         return res;
     }

     public boolean canForm(String word, HashSet<String> dict) {
         if (dict.isEmpty()) return false;
         boolean[] dp = new boolean[word.length()+1];
         dp[0] = true;
         for (int i=1; i<=word.length(); i++) {
             for (int j=0; j<i; j++) {
                 if (!dp[j]) continue;
                 String str = word.substring(j, i);
                 if (dp[j] && dict.contains(str)) {
                     dp[i] = true;
                     break;
                 }
             }
         }
         return dp[word.length()];
     }
 }

这题还应该研究一下Trie的解法， 目前还没有想好，也没有看到不错的Trie 解法