algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2026-03-13 09:50:19 +08:00
Code Issues Packages Projects Releases Wiki Activity

Modernize Python 2 code to get ready for Python 3 AGAIN

Browse Source
This commit is contained in:
cclauss
2018-01-21 08:25:19 +01:00
parent 54f6d1f6d7
commit 4ee0e620cb
6 changed files with 31 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
data_structures/Trie/Trie.py
View File

@@ -12,7 +12,7 @@ class TrieNode:
self.nodes = dict() # Mapping from char to TrieNode
self.is_leaf = False
def insert_many(self, words: [str]): # noqa: F821 This syntax is Python 3 only
def insert_many(self, words: [str]): # noqa: E999 This syntax is Python 3 only
"""
Inserts a list of words into the Trie
:param words: list of string words
@@ -21,7 +21,7 @@ class TrieNode:
for word in words:
self.insert(word)
def insert(self, word: str): # noqa: F821 This syntax is Python 3 only
def insert(self, word: str): # noqa: E999 This syntax is Python 3 only
"""
Inserts a word into the Trie
:param word: word to be inserted
@@ -34,7 +34,7 @@ class TrieNode:
curr = curr.nodes[char]
curr.is_leaf = True
def find(self, word: str) -> bool: # noqa: F821 This syntax is Python 3 only
def find(self, word: str) -> bool: # noqa: E999 This syntax is Python 3 only
"""
Tries to find word in a Trie
:param word: word to look for
@@ -48,7 +48,7 @@ class TrieNode:
return curr.is_leaf
def print_words(node: TrieNode, word: str): # noqa: F821 This syntax is Python 3 only
def print_words(node: TrieNode, word: str): # noqa: E999 This syntax is Python 3 only
"""
Prints all the words in a Trie
:param node: root node of Trie