启发式算法

843. Guess the Word

题目链接
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.

---

Abstract

• 有一个不重复的词表，包含6个小写字母的单词。
• 系统会随机选定一个单词作为 “secret”
• 系统提供的API master.guess(word) 可用来查询某个单词是否是 “secret”，它会返回一个整数，表示当前单词与secret有几个字母匹配。
• 共有10次查询机会。如果能在10次以内的查询中找出 secret 则判定通过

Idea

• 如何筛选候选单词

Solution

• 先随意选一个单词a，调用API得出这个单词与secret有几个字母匹配
• 然后把余下的单词与a对比，如果一个单词与a匹配的数目恰好等于a与secret匹配的数目，那么很有可能这个单词是secret，那么就保留它到下一轮的猜词
• 退出条件是猜词数目大于10次或者猜词得到匹配数目为6（也就是猜中了secret）

Time Complexity
O(n)

Space Complexity
O(n)

Code

public void findSecretWord(String[] wordlist, Master master) {
    Random rand = new Random();
    List<String> list = new ArrayList<>();
    
    for (String w : wordlist){
        list.add(w);
    }
    
    
    for (int i = 0; i < 10; i++){
    	// m1
        String pick = list.get(rand.nextInt(list.size()));
        int cnt = master.guess(pick);
        if (cnt == 6) return;
        List<String> next = new ArrayList<>();
        
        for (String w: list){
        // m2
            if( cnt == match(pick, w)){
                next.add(w);
            }
        }  
        list = next;
    }
}

private int match(String p, String w){
    int cnt = 0;
    for (int i = 0; i < p.length(); i++){
        if (p.charAt(i) == w.charAt(i)){
            cnt++;
        }
    }
    return cnt;
}

Mistake

1. rand.nextInt的方程不够熟悉，nextInt() 产生 0 (inclusive) 和 n(exclusive)之间的任意整数。
2. 需要比较候选单词与pick的匹配字母数而不是master.guess(候选单词)和cnt。

Summary
这种题型在面试中比较少见，感觉交流更重要