Add Trie part1

donaldgv · donaldgv · commit caaf6095b012 · 2023-09-08T11:24:47.000+07:00
diff --git a/learn/tree/day3/part1.py b/learn/tree/day3/part1.py
@@ -1,3 +1,5 @@
+import heapq
+
 def heapify(ls):
   while True:
     a = False
@@ -60,7 +62,7 @@ def heappop(ls):
 
 def solution(input):
   ls = [8,7,6,5,4,3,1]
-  heapify(ls)
-  heappush(ls,2)
+  heapq.heapify(ls)
+  print(heapq.nlargest(2,ls))
   return str(ls)
   
diff --git a/learn/tree/day4/part1.py b/learn/tree/day4/part1.py
@@ -0,0 +1,58 @@
+class TrieNode:
+  def __init__(self) -> None:
+    self.children = [None for i in range(62)]
+    self.end = False
+    
+def getindex(a):
+  if "a" <= a <= "z":
+    return ord(a)-ord("a")
+  elif "A" <= a <= "Z":
+    return ord(a)-ord("A")+26
+  elif "0" <= a <= "9":
+    return int(a) + 52
+  raise KeyError
+
+def getchr(i):
+  if 0 <= i <= 25:
+    return chr(i+ord("a"))
+  elif 26 <= i <= 51:
+    return chr(i+ord("A")-26)
+  elif 52 <= i <= 61:
+    return str(i - 52)
+  raise IndexError
+  
+def insertTrie(root,value):
+  if value == "":
+    root.end = True
+  else:
+    c = value[0]
+    i = getindex(c)
+    if root.children[i] == None:
+      root.children[i] = TrieNode()
+    insertTrie(root.children[i],value[1:])
+    
+def printTrie(root,prefix):
+  if root.end:
+    print(prefix)
+  for i in range(62):
+    if root.children[i] != None:
+      printTrie(root.children[i],prefix+getchr(i))
+  
+    
+def searchTrie(root,value):
+  if value == "":
+    return root.end
+  i = getindex(value[0])
+  if root.children[i] == None:
+    return False
+  return searchTrie(root.children[i], value[1:])
+   
+  
+def solution(input):
+  root = TrieNode()
+  insertTrie(root,"aa")
+  insertTrie(root,"ab")
+  insertTrie(root,"acd")
+  insertTrie(root,"123Aa")
+  printTrie(root,"")
+  print(searchTrie(root,"aaz"))
diff --git a/learn/tree/day4/sample.txt b/learn/tree/day4/sample.txt
