[백준 9251] LCS (Java)

 

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.StringTokenizer;
import java.util.Arrays;
 
public class Main{
    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
 
        String str_1 = br.readLine();
        String str_2 = br.readLine();
 
        int size_1 = str_1.length();
        int size_2 = str_2.length();
        int[][] dp = new int[size_1+1][size_2+1];
 
        for(int i=1; i<=size_1; i++){
            for(int j=1; j<=size_2; j++){
                if(str_1.charAt(i-1) == str_2.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[size_1][size_2]);
    }
}

 

문제 풀이 : yabmoons.tistory.com/113 / melonicedlatte.com/algorithm/2018/03/15/181550.html