[baekjoon] 2179번 - 비슷한 단어

Author: dd-jiyun

README.md

@@ -56,6 +56,7 @@
 - 2024년 9월 11일 : [b14501](https://www.acmicpc.net/problem/14501)
 - 2024년 9월 12일 : [b14502](https://www.acmicpc.net/problem/14502)
 - 2024년 9월 13일 : [b9663](https://www.acmicpc.net/problem/9663)
+- 2024년 11월 28일 : [b2179](https://www.acmicpc.net/problem/2179)
 
 ### 해시 (Hash)
 - 2024년 9월 16일 : [p42576](https://school.programmers.co.kr/learn/courses/30/lessons/42576)

b2179/Main.java

@@ -0,0 +1,82 @@
+package b2179;
+
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        int n = Integer.parseInt(br.readLine());
+        List<Word> words = readWords(br, n);
+
+        List<Word> result = findSimilarWords(words);
+
+        printResult(result);
+    }
+
+    private static List<Word> readWords(BufferedReader br, int n) throws IOException {
+        List<Word> words = new ArrayList<>();
+
+        for (int i = 0; i < n; i++) {
+            words.add(new Word(i, br.readLine()));
+        }
+
+        return words;
+    }
+
+    private static List<Word> findSimilarWords(List<Word> words) {
+        int maxPrefixLength = 0;
+
+        Word first = new Word(Integer.MAX_VALUE, "");
+        Word second = new Word(Integer.MAX_VALUE, "");
+
+        for (int i = 0; i < words.size(); i++) {
+            for (int j = i + 1; j < words.size(); j++) {
+                Word w1 = words.get(i);
+                Word w2 = words.get(j);
+
+                int prefixLength = getPrefixLength(w1.value, w2.value);
+
+                if (prefixLength > maxPrefixLength) {
+                    maxPrefixLength = prefixLength;
+                    first = w1;
+                    second = w2;
+                }
+                if (prefixLength == maxPrefixLength) {
+                    if (w1.index < first.index ||
+                            (w1.index == first.index && w2.index < second.index)) {
+                        first = w1;
+                        second = w2;
+                    }
+                }
+            }
+        }
+        return Arrays.asList(first, second);
+    }
+
+    private static int getPrefixLength(String s1, String s2) {
+        int length = 0;
+
+        while (length < s1.length() && length < s2.length() && s1.charAt(length) == s2.charAt(length)) {
+            length++;
+        }
+
+        return length;
+    }
+
+    private static void printResult(List<Word> result) {
+        System.out.println(result.get(0).value);
+        System.out.println(result.get(1).value);
+    }
+
+    static class Word {
+        int index;
+        String value;
+
+        Word(int index, String value) {
+            this.index = index;
+            this.value = value;
+        }
+    }
+}