472. Concatenated Words

最新推荐文章于 2024-11-11 20:59:17 发布

ujn20161222

最新推荐文章于 2024-11-11 20:59:17 发布

阅读量524

点赞数 4

文章标签： leetcode

本文链接：https://blog.csdn.net/ujn20161222/article/details/141929414

版权

https://leetcode.com/problems/concatenated-words/description/?envType=company&envId=tiktok&favoriteSlug=tiktok-three-months

class Solution:
    def findAllConcatenatedWordsInADict(self, words: List[str]) -> List[str]:
        ws=set(words)
        ml=min(map(len,words))

        @cache
        def is_concat(word):
            for i in range(ml,len(word)-ml+1):
                if word[:i] in ws and (word[i:] in ws or is_concat(word[i:])):
                    return True    
            return False
        return [w for w in words if is_concat(w)]

(word[i:] in ws or is_concat(word[i:])注意这一部分代码