Merge pull request #1549 from razer96/1143-Longest-Common-Subsequence.go

1143 Longest Common Subsequence golang solution

Author: dissesmac

go/1143-Longest-Common-Subsequence.go

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