백준[JAVA] 9251.LCS - 자바

📖 문제

📃 코드

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    static char c1[];
    static char c2[];
    static int dp[][];

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        c1 = br.readLine().toCharArray();
        c2 = br.readLine().toCharArray();
        // express empty set [0][0]
        dp = new int[c1.length + 1][c2.length + 1];

        System.out.println(lcs(c1, c2));
    }

    // Down-Top
    static int lcs(char str1[], char str2[]) {
        int str1_length = str1.length;
        int str2_length = str2.length;

        for (int i = 1; i <= str1_length; i++) {
            for (int j = 1; j <= str2_length; j++) {
                // when array1[i-1] == array2[j-1]
                if (str1[i - 1] == str2[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]);
                }
            }
        }
        return dp[str1_length][str2_length];
    }
}

🔗 링크

https://www.acmicpc.net/problem/9251

9251번: LCS