2024-03-16

tgyuuAn/README.md

@@ -43,4 +43,5 @@
 | 39차시 | 2023.02.18 |  DP  | <a href="https://www.acmicpc.net/problem/7579">앱</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/139
 | 40차시 | 2023.02.21 |  DP  | <a href="https://www.acmicpc.net/problem/31413">입대</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/142
 | 41차시 | 2023.03.04 |  DP  | <a href="https://www.acmicpc.net/problem/2240">자두나무</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/148
+| 45차시 | 2023.03.16 |  트라이  | <a href="https://www.acmicpc.net/problem/31413">트라이</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/162
 ---

tgyuuAn/트라이/디스크 트리.py

@@ -0,0 +1,48 @@
+import sys
+
+def input(): return sys.stdin.readline().rstrip()
+
+N = int(input())
+
+class Node():
+    def __init__(self, key):
+        self.key = key
+        self.children = {}
+
+class Tries():
+    def __init__(self):
+        self.head = Node(None)
+
+    def insert(self, path):
+        now = self.head
+        directories = path.split("\\")
+
+        for directory in directories:
+            if directory not in now.children:
+                now.children[directory] = Node(directory)
+
+            now = now.children[directory]
+
+    def dfs(self, now : Node, depth):
+        if now.key is not None:
+            for _ in range(depth):
+                print(" ", end="")
+            print(now.key)
+
+        now_children = list(now.children.keys())
+        now_children.sort()
+
+        for child in now_children:
+            self.dfs(now.children[child], depth+1)
+
+    def display_all(self):
+        now = self.head
+        self.dfs(now, -1)
+
+tries = Tries()
+
+for _ in range(N):
+    path = input()
+    tries.insert(path)
+
+tries.display_all()