From f61b25fb4e4f5353583088f153b6ed911bf1b390 Mon Sep 17 00:00:00 2001 From: gitseoyeon Date: Tue, 12 May 2026 19:43:15 +0900 Subject: [PATCH 1/2] solve: Longest Common Prefix --- .../[LCD] Longest Common Prefix/Min.java" | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 "05\354\233\224/2\354\243\274\354\260\250/[LCD] Longest Common Prefix/Min.java" diff --git "a/05\354\233\224/2\354\243\274\354\260\250/[LCD] Longest Common Prefix/Min.java" "b/05\354\233\224/2\354\243\274\354\260\250/[LCD] Longest Common Prefix/Min.java" new file mode 100644 index 0000000..ec0f9e1 --- /dev/null +++ "b/05\354\233\224/2\354\243\274\354\260\250/[LCD] Longest Common Prefix/Min.java" @@ -0,0 +1,20 @@ +class Min { + public String longestCommonPrefix(String[] strs) { + String prefix = ""; + + int len = 201; + for(String str : strs) { + len = Math.min(str.length(), len); + } + + for(int i = 0; i < len; i++) { + char c = strs[0].charAt(i); + for(String str : strs) { + if(str.charAt(i) != c) return prefix; + } + prefix += c; + } + + return prefix; + } +} \ No newline at end of file From f835ec92603c89ac6015ed10b54bdd75715249ce Mon Sep 17 00:00:00 2001 From: gitseoyeon Date: Tue, 12 May 2026 19:43:26 +0900 Subject: [PATCH 2/2] solve: Roman to Integer --- .../[LCD] Roman to Integer/Min.java" | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 "05\354\233\224/2\354\243\274\354\260\250/[LCD] Roman to Integer/Min.java" diff --git "a/05\354\233\224/2\354\243\274\354\260\250/[LCD] Roman to Integer/Min.java" "b/05\354\233\224/2\354\243\274\354\260\250/[LCD] Roman to Integer/Min.java" new file mode 100644 index 0000000..accc14d --- /dev/null +++ "b/05\354\233\224/2\354\243\274\354\260\250/[LCD] Roman to Integer/Min.java" @@ -0,0 +1,27 @@ +import java.util.*; + +class Min { + public int romanToInt(String s) { + HashMap hm = new HashMap<>(); + hm.put('I', 1); + hm.put('V', 5); + hm.put('X', 10); + hm.put('L', 50); + hm.put('C', 100); + hm.put('D', 500); + hm.put('M', 1000); + + int sum = 0; + for(int i = 0; i < s.length(); i++) { + char c = s.charAt(i); + int num = hm.get(c); + if(i + 1 < s.length() && hm.get(s.charAt(i + 1)) > num) { + sum += hm.get(s.charAt(++i)) - num; + continue; + } + sum += num; + } + + return sum; + } +} \ No newline at end of file