zoukankan      html  css  js  c++  java
  • Week6

    Week6 - 676.Implement Magic Dictionary

    Implement a magic directory with buildDict, and search methods.
    For the method buildDict, you'll be given a list of non-repetitive words to build a dictionary.
    For the method search, you'll be given a word, and judge whether if you modify exactly one character into another character in this word, the modified word is in the dictionary you just built.

    Example 1:
    Input: buildDict(["hello", "leetcode"]), Output: Null
    Input: search("hello"), Output: False
    Input: search("hhllo"), Output: True
    Input: search("hell"), Output: False
    Input: search("leetcoded"), Output: False
    

    Note:
    You may assume that all the inputs are consist of lowercase letters a-z.
    For contest purpose, the test data is rather small by now. You could think about highly efficient algorithm after the contest.
    Please remember to RESET your class variables declared in class MagicDictionary, as static/class variables are persisted across multiple test cases. Please see here for more details.

    my solution:

    #include<string>
    #include<vector>
    using namespace std;
    
    class MagicDictionary {
    public:
      /** Initialize your data structure here. */
      vector<string> dictionary;
      MagicDictionary() {
    
      }
    
      /** Build a dictionary through a list of words */
      void buildDict(vector<string> dict) {
        dictionary = dict;
      }
    
      /** Returns if there is any word in the trie that equals to the given word after modifying exactly one character */
      bool search(string word) {
        for (size_t i = 0; i < dictionary.size(); i++) {
          if (word.size() == dictionary[i].size() ) {
            int count = 0;
            for (size_t j = 0; j < word.size(); j++) {
              if (word[j] != dictionary[i][j]) count++;
              if (count > 1) break;
            }
            if (count == 1) return true;
          }
        }
        return false;
      }
    };
  • 相关阅读:
    ubuntu开启SSH服务
    [FreeModbus源码分析] 1.协议简介
    minicom无法输入问题
    Redis学习sorted set数据类型
    Redis学习string数据类型
    Redis学习list数据类型
    Redis学习常用命令
    Redis学习hash数据类型
    Redis学习set数据结构
    Redis初探Redis安装
  • 原文地址:https://www.cnblogs.com/JerryChan31/p/7692528.html
Copyright © 2011-2022 走看看