本文共 998 字，大约阅读时间需要 3 分钟。

题目：（中等）

标签：哈希表、动态规划

解法一（哈希表）：

class Solution:    def longestStrChain(self, words: List[str]) -> int:        words.sort(key=lambda x: len(x))        ans = 1        count = {
   }        for word in words:            size = len(word)            if size == 1:                count[word] = 1            else:                min_from = float("inf")                for i in range(size):                    sorted_word = "".join(sorted(word[:i] + word[i + 1:]))                    if sorted_word in count:                        min_from = min(min_from, count[sorted_word])                if min_from != float("inf"):                    ans = max(ans, size - min_from + 1)                    count["".join(sorted(word))] = min_from                else:                    count["".join(sorted(word))] = size        return ans

转载地址：https://dataartist.blog.csdn.net/article/details/109844778 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！