leetcode1408

class Solution:
    def stringMatching(self, words: 'List[str]') -> 'List[str]':
        n = len(words)
        words = sorted(words,key=lambda x:len(x))
        res = set()
        for i in range(n):
            cur = words[i]
            for j in range(i+1,n):
                target = words[j]
                if target.find(cur) >= 0:
                    res.add(cur)
        return list(res)

算法类型：字符串子串判断。

双层循环，时间复杂度O(n^2)