LeetCode 843. Guess the Word

原题链接在这里：https://leetcode.com/problems/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.

题解：

We want to choose a word from wordlist and guess use it.

Then how shall we choose such a word. We want to choose a word that could give us as much infomation as possible. If guess this word and return 0, then it doesn't give us any useful infomation.

Thus, we check the matches between each other in the wordlist and accumlate the multiplicity when match == 0.

And we want to use the word that has least 0 matches.

Use it to guess and update new wordlist.

Time Complexity: O(m ^ 2 * n). m = wordlist.length. n = word length.

Space: O(m).

AC Java:

 1 /**
 2  * // This is the Master's API interface.
 3  * // You should not implement it, or speculate about its implementation
 4  * interface Master {
 5  *     public int guess(String word) {}
 6  * }
 7  */
 8 class Solution {
 9     public void findSecretWord(String[] wordlist, Master master) {
10         for(int i = 0; i < 10; i++){
11             if(wordlist == null || wordlist.length == 0){
12                 return;
13             }
14 
15             HashMap<String, Integer> hm = new HashMap<>();
16 
17             for(String w : wordlist){
18                 for(String c : wordlist){
19                     if(match(w, c) == 0){
20                         hm.put(w, hm.getOrDefault(w, 0) + 1);
21                     }
22                 }
23             }
24 
25             int min = Integer.MAX_VALUE;
26             String minWord = "";
27             for(String w : wordlist){
28                 if(hm.getOrDefault(w, 0) < min){
29                     min = hm.getOrDefault(w, 0);
30                     minWord = w;
31                 }
32             }
33 
34             int x = master.guess(minWord);
35             List<String> nextList = new ArrayList<>();
36             for(String w : wordlist){
37                 if(match(w, minWord) == x){
38                     nextList.add(w);
39                 }
40             }
41 
42             wordlist = nextList.toArray(new String[nextList.size()]);
43         }
44     }
45     
46     private int match(String p, String q){
47         if(p == null || q == null){
48             return 0;
49         }
50         
51         int m = p.length();
52         int n = q.length();
53         int res = 0;
54         for(int i = 0; i < Math.min(m, n); i++){
55             if(p.charAt(i) == q.charAt(i)){
56                 res++;
57             }
58         }
59         
60         return res;
61     }
62 }