码迷,mamicode.com
首页 > 其他好文 > 详细

676. Implement Magic Dictionary 实现魔术字典

时间:2017-12-14 22:55:06      阅读:191      评论:0      收藏:0      [点我收藏+]

标签:rds   span   search   void   set   字典   imp   gpo   add   

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:

  1. You may assume that all the inputs are consist of lowercase letters a-z.

  2. For contest purpose, the test data is rather small by now. You could think about highly efficient algorithm after the contest.

  3. 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.


  1. /**
  2. * Initialize your data structure here.
  3. */
  4. var MagicDictionary = function () {
  5. this.words = new Set();
  6. };
  7. /**
  8. * Build a dictionary through a list of words
  9. * @param {string[]} dict
  10. * @return {void}
  11. */
  12. MagicDictionary.prototype.buildDict = function (dict) {
  13. for (var i in dict) {
  14. this.words.add(dict[i]);
  15. }
  16. };
  17. /**
  18. * Returns if there is any word in the trie that equals to the given word after modifying exactly one character
  19. * @param {string} word
  20. * @return {boolean}
  21. */
  22. MagicDictionary.prototype.search = function (word) {
  23. for (let i = 0; i < word.length; i++) {
  24. for (let code = 65; code < 91; code++) {
  25. let c = String.fromCharCode(code).toLowerCase();
  26. if (word[i] == c) continue;
  27. let str = word.slice(0, i) + c + word.slice(i + 1, word.length);
  28. if (this.words.has(str)) return true;
  29. }
  30. }
  31. return false;
  32. };
  33. let func = ["MagicDictionary", "buildDict", "search", "search", "search", "search"];
  34. let arg = [[], [["hello", "leetcode"]], ["hello"], ["hhllo"], ["hell"], ["leetcoded"]];
  35. let dict = new MagicDictionary();
  36. for (var i = 1; i < func.length; i++) {
  37. console.log(dict[func[i]](arg[i][0]));
  38. }
  39. /**
  40. * Your MagicDictionary object will be instantiated and called as such:
  41. * var obj = Object.create(MagicDictionary).createNew()
  42. * obj.buildDict(dict)
  43. * var param_2 = obj.search(word)
  44. */







676. Implement Magic Dictionary 实现魔术字典

标签:rds   span   search   void   set   字典   imp   gpo   add   

原文地址:http://www.cnblogs.com/xiejunzhao/p/8040329.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!