Merge pull request #155 from AlgoLeadMe/38-Munbin-Lee

38-Munbin-Lee

Munbin-Lee/README.md

@@ -38,4 +38,5 @@
 | 35차시 | 2024.02.18 |  백트래킹  | <a href="https://www.acmicpc.net/problem/24891">단어 마방진</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/140 |
 | 36차시 | 2024.02.21 |  문자열  | <a href="https://www.acmicpc.net/problem/15927">회문은 회문아니야!!</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/143 |
 | 37차시 | 2024.03.05 |  백트래킹  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/250136">석유 시추</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/150 |
+| 37차시 | 2024.03.08 |  트라이  | <a href="https://www.acmicpc.net/problem/5052">전화번호 목록</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/155 |
 ---

Munbin-Lee/트리/38-전화번호 목록.cpp

@@ -0,0 +1,80 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+struct Trie {
+    struct Node {
+        Node *children[10]{};
+        bool isTerminal = false;
+    };
+
+    Node *root = new Node;
+
+    bool insert(string &s) const {
+        auto cur = root;
+
+        for (char ch: s) {
+            int digit = ch - '0';
+
+            if (!cur->children[digit]) {
+                cur->children[digit] = new Node();
+                cur = cur->children[digit];
+                continue;
+            }
+
+            if (cur->children[digit]->isTerminal) {
+                return false;
+            }
+
+            cur = cur->children[digit];
+        }
+
+        for (auto child: cur->children) {
+            if (child) {
+                return false;
+            }
+        }
+
+        cur->isTerminal = true;
+
+        return true;
+    }
+};
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    auto solve = []() {
+        auto trie = new Trie;
+
+        int n;
+        cin >> n;
+
+        vector<string> numbers(n);
+
+        for (auto &number: numbers) {
+            cin >> number;
+        }
+
+        for (auto number: numbers) {
+            if (!trie->insert(number)) {
+                cout << "NO\n";
+                delete trie;
+                return;
+            }
+        }
+
+        cout << "YES\n";
+    };
+
+    int t;
+    cin >> t;
+
+    while (t--) {
+        solve();
+    }
+
+    return 0;
+}