public class algorithm211 {
    @Test
    public void test(){
        WordDictionary dictionary = new WordDictionary();
        dictionary.addWord("bad");
        dictionary.addWord("dad");
        System.out.println(dictionary.search("pad"));
        System.out.println(dictionary.search("bad"));
        System.out.println(dictionary.search(".ad"));
        System.out.println(dictionary.search("b.."));
    }

    class WordDictionary {
        private Map<Integer, List<String>> dictionary = null;
        /** Initialize your data structure here. */
        public WordDictionary() {
            dictionary = new HashMap<>();
        }

        /** Adds a word into the data structure. */
        public void addWord(String word) {
            List<String> list = dictionary.get(word.length());
            if(list == null){
                list = new ArrayList<>();
            }
            list.add(word);
            dictionary.put(word.length(),list);
        }

        /** Returns if the word is in the data structure. A word could contain the dot character '.' to represent any one letter. */
        public boolean search(String word) {
            int len = word.length();
            List<String> list = dictionary.get(len);
            boolean flag = false;
            for(String str : list){
                boolean f = true;
                for(int i = 0;i < len;i++){
                    if(word.charAt(i) != '.'){
                        if(word.charAt(i) != str.charAt(i))
                            f = false;
                    }
                }
                if(f){
                    flag = true;
                    break;
                }
            }
            return flag;
        }
    }
}