solve 4

Author: lylaminju

longest-common-subsequence/pmjuu.py

@@ -0,0 +1,20 @@
+'''
+시간 복잡도: O(m * n)
+공간 복잡도: O(n)
+'''
+
+class Solution:
+    def longestCommonSubsequence(self, text1: str, text2: str) -> int:
+        m, n = len(text1), len(text2)
+        prev = [0] * (n + 1)
+
+        for i in range(1, m + 1):
+            curr = [0] * (n + 1)
+            for j in range(1, n + 1):
+                if text1[i - 1] == text2[j - 1]:
+                    curr[j] = prev[j - 1] + 1
+                else:
+                    curr[j] = max(prev[j], curr[j - 1])
+            prev = curr  # 현재 행을 이전 행으로 업데이트
+
+        return prev[n]