comment modify

Author: hoyeongkwak

group-anagrams/hoyeongkwak.py

@@ -12,9 +12,9 @@
 class Solution:
     def groupAnagrams(self, strs: List[str]) -> List[List[str]]:
         strResult = {}
-        for str in strs:
-            sortedStr = ''.join(sorted(str))
+        for word in strs:
+            sortedStr = ''.join(sorted(word))
             if sortedStr not in strResult:
                 strResult[sortedStr] = []
-            strResult[sortedStr].append(str)
+            strResult[sortedStr].append(word)
         return list(strResult.values())

implement-trie-prefix-tree/hoyeongkwak.py

@@ -12,20 +12,20 @@
 space complexity : O(1)
 '''
 
-class TriedNode:
+class TrieNode:
     def __init__(self):
         self.children = {}
         self.isEnd = False
 
 class Trie:
     def __init__(self):
-        self.root = TriedNode()
+        self.root = TrieNode()
 
     def insert(self, word: str) -> None:
         node = self.root
         for char in word:
             if char not in node.children:
-                node.children[char] = TriedNode()
+                node.children[char] = TrieNode()
             node = node.children[char]
         node.isEnd = True
 

word-break/hoyeongkwak.py

@@ -1,5 +1,5 @@
 '''
-TriedNode
+TrieNode
 a : alphabet size
 time complexity : O(m)
 space complexity : O(m * a)
@@ -8,19 +8,19 @@
 time complexity : O(n^2)
 space complexity : O(n)
 '''
-class TriedNode:
+class TrieNode:
     def __init__(self):
         self.children = {}
         self.isEnd = False
 class Trie:
     def __init__(self):
-        self.root = TriedNode()
+        self.root = TrieNode()
 
     def insert(self, word):
         node = self.root
         for char in word:
             if char not in node.children:
-                node.children[char] = TriedNode()
+                node.children[char] = TrieNode()
             node = node.children[char]
         node.isEnd = True