leetcode 472. Concatenated Words

发表于 | 分类于

Given a list of words (without duplicates), 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:

1
2
3
4
5
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.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
class Solution(object):
    def findAllConcatenatedWordsInADict(self, words):
        """
        :type words: List[str]
        :rtype: List[str]
        """
        word_set = set(words)
        result = []
        def dfs(word,cur,cnt):
            if cur == len(word):
                if cnt > 1:
                    return True
                else:
                    return False
            
            for i in xrange(cur+1,len(word)+1):
                if word[cur:i] in word_set and dfs(word,i,cnt+1):
                    return True
            return False
        for word in words:
            if dfs(word,0,0):
                result.append(word)
        return result