Merge pull request #1018 from AlgorithmWithGod/LiiNi-coder

[20251001] BOJ / G5 / LCS / 이인희

Author: ShinHeeEul

LiiNi-coder/202510/01 BOJ LCS.md

@@ -0,0 +1,27 @@
+```java
+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));
+        String A = br.readLine();
+        String B = br.readLine();
+        int n = A.length();
+        int m = B.length();
+
+        int[][] dp = new int[n + 1][m + 1];
+        for(int i = 1; i <= n; i++) {
+            for(int j = 1; j <= m; j++) {
+                if(A.charAt(i - 1) == B.charAt(j - 1)) {
+                    dp[i][j] = dp[i-1][j-1] + 1;
+                } else {
+                    dp[i][j] = Math.max(dp[i-1][j], dp[i][j- 1]);
+                }
+            }
+        }
+        System.out.println(dp[n][m]);
+    }
+}
+
+```