LeetCode 843. Guess the Word 题有bug_matching the current guessed word-优快云博客

本文链接：https://blog.youkuaiyun.com/taoqick/article/details/106899489

本文解析了LeetCode平台上的一款互动猜词游戏的算法实现，玩家需从给定的单词列表中通过有限次数的猜测找到秘密单词。文章详细介绍了游戏规则、评分标准及示例，同时分享了一种可能的解决方案，探讨了算法设计与优化。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

This problem is an interactive problem new to the LeetCode platform.

We are given a word list of unique words, each word is 6 letters long, and one word in this list is chosen as secret.

You may call master.guess(word) to guess a word. The guessed word should have type string and must be from the original list with 6 lowercase letters.

This function returns an integer type, representing the number of exact matches (value and position) of your guess to the secret word. Also, if your guess is not in the given wordlist, it will return -1 instead.

For each test case, you have 10 guesses to guess the word. At the end of any number of calls, if you have made 10 or less calls to master.guess and at least one of these guesses was the secret, you pass the testcase.

Besides the example test case below, there will be 5 additional test cases, each with 100 words in the word list. The letters of each word in those testcases were chosen independently at random from 'a' to 'z', such that every word in the given word lists is unique.

Example 1:
Input: secret = "acckzz", wordlist = ["acckzz","ccbazz","eiowzz","abcczz"]

Explanation:

master.guess("aaaaaa") returns -1, because "aaaaaa" is not in wordlist.
master.guess("acckzz") returns 6, because "acckzz" is secret and has all 6 matches.
master.guess("ccbazz") returns 3, because "ccbazz" has 3 matches.
master.guess("eiowzz") returns 2, because "eiowzz" has 2 matches.
master.guess("abcczz") returns 4, because "abcczz" has 4 matches.

We made 5 calls to master.guess and one of them was the secret, so we pass the test case.

Note: Any solutions that attempt to circumvent the judge will result in disqualification.

------------------------------------------------

这题踩比顶多，估计大家跟我有一样的困惑，如果wordLists是["abcdea","abcdeb",...,"abcdez"]的26个，按照以下解法是得不到解的：

class Solution:
    def findSecretWord(self, wordlist: List[str], master: 'Master') -> None:
        
        match, trials = 0, 0
        newl = wordlist
        
        def match_w(word, pick):
            m = 0
            for i, letter in enumerate(word):
                if letter == pick[i]: m += 1
            return m
            
        while trials < 10 and match < 6:
            i = random.randint(0, len(newl)-1)
            pick = newl[i]
            match = master.guess(pick)
            trials += 1
            newl = [word for word in newl if match_w(word, pick) == match]