Longest Common Subsequence

Author: TonyKim9401

longest-common-subsequence/TonyKim9401.java

@@ -0,0 +1,23 @@
+// TC: O(n * m)
+// the length of text1 by the length of text2
+// SC: O(n)
+// both size of text1 and text2 can be the size of dp
+class Solution {
+    public int longestCommonSubsequence(String text1, String text2) {
+        int[] dp = new int[text2.length()];
+        int output = 0;
+
+        for (char c : text1.toCharArray()) {
+            int curLength = 0;
+
+            for (int i = 0; i < dp.length; i++) {
+                if (curLength < dp[i]) curLength = dp[i];
+                else if (c == text2.charAt(i)) {
+                    dp[i] = curLength + 1;
+                    output = Math.max(output, dp[i]);
+                }
+            }
+        }
+        return output;
+    }
+}