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

推荐订阅源

Jina AI
Jina AI
云风的 BLOG
云风的 BLOG
人人都是产品经理
人人都是产品经理
T
The Blog of Author Tim Ferriss
阮一峰的网络日志
阮一峰的网络日志
罗磊的独立博客
J
Java Code Geeks
博客园 - 聂微东
B
Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
WordPress大学
WordPress大学
腾讯CDC
L
LangChain Blog
Apple Machine Learning Research
Apple Machine Learning Research
Microsoft Azure Blog
Microsoft Azure Blog
D
DataBreaches.Net
The GitHub Blog
The GitHub Blog
美团技术团队
博客园 - Franky
Google DeepMind News
Google DeepMind News
V
V2EX
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
月光博客
月光博客
The Cloudflare Blog

博客园 - 司徒正美

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')