🟩 [백준] [Python] [Gold5] 9251번_LCS

문제

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

9251번: LCS

풀이

# 백준 9251번 문제 - LCS
str1 = ' ' + input()
str2 = ' ' + input()
dp = [[0]*len(str1) for _ in range(len(str2))]

for i in range(1, len(str2)):
    for j in range(1, len(str1)):
        if str2[i] == str1[j]:
            dp[i][j] = dp[i-1][j-1] + 1
        else:
            dp[i][j] = max(dp[i-1][j], dp[i][j-1])
print(dp[-1][-1])