엔지니어 게시판
LeetCode 솔루션 분류

[6/15] 1048. Longest String Chain

컨텐츠 정보

본문

Medium
4650195Add to ListShare

You are given an array of words where each word consists of lowercase English letters.

wordA is a predecessor of wordB if and only if we can insert exactly one letter anywhere in wordA without changing the order of the other characters to make it equal to wordB.

  • For example, "abc" is a predecessor of "abac", while "cba" is not a predecessor of "bcad".

word chain is a sequence of words [word1, word2, ..., wordk] with k >= 1, where word1 is a predecessor of word2word2 is a predecessor of word3, and so on. A single word is trivially a word chain with k == 1.

Return the length of the longest possible word chain with words chosen from the given list of words.

 

Example 1:

Input: words = ["a","b","ba","bca","bda","bdca"]
Output: 4
Explanation: One of the longest word chains is ["a","ba","bda","bdca"].

Example 2:

Input: words = ["xbc","pcxbcf","xb","cxbc","pcxbc"]
Output: 5
Explanation: All the words can be put in a word chain ["xb", "xbc", "cxbc", "pcxbc", "pcxbcf"].

Example 3:

Input: words = ["abcd","dbqca"]
Output: 1
Explanation: The trivial word chain ["abcd"] is one of the longest word chains.
["abcd","dbqca"] is not a valid word chain because the ordering of the letters is changed.

 

Constraints:

  • 1 <= words.length <= 1000
  • 1 <= words[i].length <= 16
  • words[i] only consists of lowercase English letters.

관련자료

댓글 1

학부유학생님의 댓글

  • 익명
  • 작성일
class Solution:
    def longestStrChain(self, words: List[str]) -> int:
        word_dict = {}
        
        for word in words:
            word_dict[word] = 1

        for word in sorted(words, key=len):
            for i in range(len(word)):
                prev = word[:i] + word[i+1:]
                if prev in word_dict:
                    word_dict[word] = max(word_dict[word], word_dict[prev]+1)
        return max(word_dict.values())
전체 404 / 13 페이지
번호
제목
이름

최근글


인기글


새댓글


Stats


알림 0