惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Apple Machine Learning Research
Apple Machine Learning Research
J
Java Code Geeks
博客园 - 聂微东
Microsoft Azure Blog
Microsoft Azure Blog
量子位
T
Tailwind CSS Blog
Vercel News
Vercel News
I
InfoQ
Stack Overflow Blog
Stack Overflow Blog
U
Unit 42
Engineering at Meta
Engineering at Meta
L
LangChain Blog
大猫的无限游戏
大猫的无限游戏
D
Docker
博客园_首页
P
Proofpoint News Feed
月光博客
月光博客
T
The Blog of Author Tim Ferriss
MyScale Blog
MyScale Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
Martin Fowler
Martin Fowler
腾讯CDC
N
Netflix TechBlog - Medium
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More

博客园 - 司徒正美

leetcode 91. Decode Ways leetcode 1214 Two Sum BSTs leetcode 213 House Robber II leetcode 198 House Robber I leetcode 986. Interval List Intersections leetcode 869. Reordered Power of 2 leetcode 925. Long Pressed Name leetcode 457. Circular Array Loop leetcode 1093. Statistics from a Large Sample leetcode 881. Boats to Save People leetcode 977. Squares of a Sorted Array leetcode 844. Backspace String Compare leetcode 1032. Stream of Characters leetcode 1023. Camelcase Matching leetcode 745 Prefix and Suffix Search leetcode 720. Longest Word in Dictionary leetcode 692. Top K Frequent Words leetcode 677. Map Sum Pairs leetcode 648. Replace Words
leetcode 676. Implement Magic Dictionary
司徒正美 · 2019-12-27 · via 博客园 - 司徒正美

使用Tire 处理

function Node(value) {
      this.word = null
      this.children = {}
    }
    class MagicDictionary {
      constructor() {
        this.root = new Node(null)
      }
      addWord(word) {
        var node = this.root;
        for (var i = 0; i < word.length; i++) {
          var next = word[i]
          if (!node.children[next]) {
            node.children[next] = new Node()
          }
          node = node.children[next]
        }
        node.isEnd = true
      }
      buildDict(words) {
        for (let word of words) {
          this.addWord(word)
        }
      }
      search(word) {
        var v = !!searchInner(this.root, word, 0, 0);
        console.log(v);
        return v
      }
    }

    function searchInner(node, word, index, flag) {
      if (index < word.length) {
        var cur = word[index]
        if (node.children[cur]) {
          if (searchInner(node.children[cur], word, index + 1, flag)) {
            return true
          }
        }
        if (!flag) {
          for (let c in node.children) {
            if (c !== cur && searchInner(node.children[c], word, index + 1, true)) {
              return true
            }
          }
        }
        return false
      }
      return (flag && node.isEnd);
    }



    var tire = new MagicDictionary()
    tire.buildDict(["hello", "leetcode"])
    tire.search('hello')
    tire.search('hhllo')
    tire.search('hell')
    tire.search('leetcoded')


    var tire1 = new MagicDictionary()
    tire1.buildDict(["hello", "hallo", "leetcode"])
    tire1.search('hello')
    tire1.search('hhllo')
    tire1.search('hell')
    tire1.search('leetcodd')