给定一组单词words,编写一个程序,找出其中的最长单词,且该单词由这组单词中的其他单词组合而成。若有多个长度相同的结果,返回其中字典序最小的一项,若没有符合要求的单词则返回空字符串。
示例:
输入: ["cat","banana","dog","nana","walk","walker","dogwalker"]
输出: "dogwalker"
解释: "dogwalker"可由"dog"和"walker"组成。
提示:
0 <= len(words) <= 200
1 <= len(words[i]) <= 100
一、递归
class Solution:
def longestWord(self, words: List[str]) -> str:
def is_word(word):
for i in range(len(word)):
left = word[:i]
right = word[i:]
if left in words:
if right in words:
return True
elif is_word(right):
return True
else:
continue
else:
continue
return False
res = ''
for word in words:
if is_word(word):
if len(word) > len(res):
res = word
elif len(word) == len(res):
res = min(res, word)
return res
二、字典树+回溯
class Solution:
def longestWord(self, words: List[str]) -> str:
if not words or not words[0]:
return ""
words.sort(key=(lambda x:[-len(x),x]))
dic={}
for i,word in enumerate(words):
if word[0] in dic:
dic[word[0]].append(i)
else:
dic[word[0]]=[i]
def isCmp(word,pos,memo,i):
if pos==len(word):
return True
else:
if memo[pos]==-1:
return False
if word[pos] in dic :
for j in dic[word[pos]]:
if j!=i and words[j]==word[pos:pos+len(words[j])] and isCmp(word,pos+len(words[j]),memo,i):
return True
else:
memo[pos]=-1
return False
for i,word in enumerate(words):
memo=[0]*len(word)
if isCmp(word,0,memo,i):
return word
return ""