python leetcode 208. Implement Trie (Prefix Tree)

最新推荐文章于 2024-03-22 00:51:13 发布

Neekity

最新推荐文章于 2024-03-22 00:51:13 发布

阅读量743

点赞数

CC 4.0 BY-SA版权

分类专栏： python leetcode 文章标签： python leetcode

本文链接：https://blog.youkuaiyun.com/Neekity/article/details/85036534

python 同时被 2 个专栏收录

263 篇文章

订阅专栏

leetcode

221 篇文章

订阅专栏

本文详细介绍了一种高效的数据结构——Trie树的实现方法，包括插入、搜索和前缀匹配等功能，通过两个不同实现展示了Trie树在字符串操作中的应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

class TrieNode:
    def __init__(self):
        self.children = {}
        self.isWord = False
class Trie:

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.root=TrieNode()

    def insert(self, word):
        """
        Inserts a word into the trie.
        :type word: str
        :rtype: void
        """
        cur=self.root
        for w in word:
            if not w in cur.children:
                cur.children[w]=TrieNode()
            cur=cur.children[w]
        cur.isWord=True

    def search(self, word):
        """
        Returns if the word is in the trie.
        :type word: str
        :rtype: bool
        """
        cur=self.root
        for w in word:
            if not w in cur.children: return False
            cur=cur.children[w]
        return cur.isWord

    def startsWith(self, prefix):
        """
        Returns if there is any word in the trie that starts with the given prefix.
        :type prefix: str
        :rtype: bool
        """
        cur=self.root
        for w in prefix:
            if not w in cur.children: return False
            cur=cur.children[w]
        return True

import collections
class Node(object):
    def __init__(self):
        self.children = collections.defaultdict(Node)
        self.isword = False
class Trie(object):
    
    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.root = Node()
        
    def insert(self, word):
        """
        Inserts a word into the trie.
        :type word: str
        :rtype: void
        """
        current = self.root 
        for w in word:
            current = current.children[w]
        current.isword = True

    def search(self, word):
        """
        Returns if the word is in the trie.
        :type word: str
        :rtype: bool
        """
        current = self.root
        for w in word:
            current = current.children.get(w)
            if current == None:
                return False 
        return current.isword

    def startsWith(self, prefix):
        """
        Returns if there is any word in the trie that starts with the given prefix.
        :type prefix: str
        :rtype: bool
        """
        current = self.root 
        for w in prefix:
            current = current.children.get(w)
            if current == None:
                return False 
        return True