[String] baekjoon-5052

Author: Seogeurim

README.md

@@ -50,6 +50,7 @@
 | 07  |     | [Baekjoon-10256 돌연변이](./src/String/P10256)       | Aho-Corasick |
 | 08  |     | [Baekjoon-15740 A+B - 9](./src/String/P15740)     |              |
 | 09  |     | [Baekjoon-9093 단어 뒤집기](./src/String/P9093)     |              |
+| 10  |     | [Baekjoon-5052 전화번호 목록](./src/String/P5052)    |              |
 
 ## Brute Force
 

src/String/P5052/Main.java

@@ -0,0 +1,61 @@
+package String.P5052;
+
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static int T, N;
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/String/P5052/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        T = Integer.parseInt(br.readLine());
+        while (T-- > 0) {
+            N = Integer.parseInt(br.readLine());
+            Trie t = new Trie();
+            while (N-- > 0) t.insert(br.readLine());
+            t.query();
+        }
+    }
+
+    static class Trie {
+        Node root = new Node();
+
+        void insert(String s) {
+            Node cur = root;
+            for (int i = 0; i < s.length(); i++) {
+                int c = s.charAt(i) - '0';
+                if (!cur.hasChild(c)) cur.children[c] = new Node();
+                cur = cur.children[c];
+            }
+            cur.isEnd = true;
+        }
+
+        void query() {
+            Queue<Node> q = new LinkedList<>();
+            q.offer(root);
+            while (!q.isEmpty()) {
+                Node cur =  q.poll();
+                for (int i = 0; i < 10; i++) {
+                    if (cur.hasChild(i)) {
+                        if (cur.isEnd) {
+                            System.out.println("NO");
+                            return;
+                        }
+                        q.offer(cur.children[i]);
+                    }
+                }
+            }
+            System.out.println("YES");
+        }
+    }
+
+    static class Node {
+        Node[] children = new Node[10];
+        boolean isEnd = false;
+
+        boolean hasChild(int i) { return children[i] != null; }
+    }
+}

src/String/P5052/README.md

@@ -0,0 +1,5 @@
+## [baekjoon-5052] 전화번호 목록
+
+![image](https://user-images.githubusercontent.com/22045163/107534932-a68ea500-6c03-11eb-9487-3d0180734baa.png)
+
+![image](https://user-images.githubusercontent.com/22045163/107535120-cd4cdb80-6c03-11eb-90a8-8db6f753bf8a.png)

src/String/P5052/input.txt

@@ -0,0 +1,11 @@
+2
+3
+911
+97625999
+91125426
+5
+113
+12340
+123440
+12345
+98346