[学习笔记] leetcode 843. 猜猜这个单词

import java.util.ArrayList;
import java.util.List;

public class Solution {
    int[][] H; // H[i][j]表示第i个和第j个字符串相同字母&位置的个数

    public void findSecretWord(String[] wordlist, Master master) {
        int N = wordlist.length;
        H = new int[N][N];
        for (int i = 0; i < N; ++i) {
            for (int j = i; j < N; ++j) {
                int match = 0;
                for (int k = 0; k < 6; ++k) {
                    if (wordlist[i].charAt(k) == wordlist[j].charAt(k))
                        match++;
                }
                H[i][j] = H[j][i] = match;
            }
        }
        List<Integer> possible = new ArrayList(); // 可能的词
        List<Integer> path = new ArrayList(); // 已比较过的词
        for (int i = 0; i < N; ++i) {
            possible.add(i);
        }

        while (!possible.isEmpty()) {
            int guess = solve(possible, path); // 获取下一个用于猜测的词的索引
            int matches = master.guess(wordlist[guess]);
            if (matches == wordlist[0].length()) {
                return;
            }
            List<Integer> possible2 = new ArrayList();
            for (Integer j : possible) {
                if (H[guess][j] == matches) { // 如果一个单词已经匹配了matcher位，那么有可能全部匹配的单词至少要和当前这个单词有matcher位相同
                    possible2.add(j);
                }
            }
            possible = possible2;
            path.add(guess);
        }

    }

    public int solve(List<Integer> possible, List<Integer> path) {
        // 如果只有1个或两个单词了，就直接返回第一个
        if (possible.size() <= 2) {
            return possible.get(0);
        }
        List<Integer> ansgrp = possible;
        int ansguess = -1;

        // 找出没有猜过的词中，和possible中其他词匹配相同个数字符时，能匹配最多个词的那个词
        for (int guess = 0; guess < H.length; ++guess) {
            if (!path.contains(guess)) { // 排除已猜过的单词
                ArrayList<Integer>[] groups = new ArrayList[7];
                // i < 7的原因是两个词匹配的字符个数可能是[0,6]
                // groups表示和guess所在的词匹配的字符分别是[0,6]的词的list
                for (int i = 0; i < 7; ++i) {
                    groups[i] = new ArrayList<Integer>();
                }
                for (Integer j : possible) {
                    if (j != guess) { // 不能是词自己和自己比
                        groups[H[guess][j]].add(j);
                    }
                }
                ArrayList<Integer> maxgroup = groups[0];
                // 选出groups中list最长的那个list
                for (int i = 0; i < 7; ++i) {
                    if (groups[i].size() > maxgroup.size()) {
                        maxgroup = groups[i];
                    }
                }

                if (maxgroup.size() < ansgrp.size()) {
                    ansgrp = maxgroup;
                    ansguess = guess;
                }
            }
        }

        return ansguess;
    }

}

interface Master {
    public int guess(String word);
}