leetcode 1143

leetcode/1143/1143.go

@@ -0,0 +1,29 @@
+func max(a, b int) int {
+    if a > b {
+        return a
+    }
+    return b
+}
+
+func longestCommonSubsequence(text1 string, text2 string) int {
+    n1 := len(text1)
+    n2 := len(text2)
+
+    dp := make([][]int, n1+1)
+    for i:=0; i<=n1; i++ {
+        dp[i] = make([]int, n2+1)
+    }
+
+    dp[0][0] = 0
+    for i:=1; i<=n1; i++ {
+        for j:=1; j<=n2; j++ {
+            if text1[i-1] == text2[j-1] {
+                dp[i][j] = dp[i-1][j-1] + 1
+            } else {
+                dp[i][j] = max(dp[i-1][j], dp[i][j-1])
+            }
+        }
+    }
+
+    return dp[n1][n2]
+}