Leetcode - Longest Common Subsequence
https://leetcode.com/problems/longest-common-subsequence/
Given two strings text1 and text2, return the length of their longest common subsequence.
A subsequence of a string is a new string generated from the original string with some characters(can be none) deleted without changing the relative order of the remaining characters. (eg, "ace" is a subsequence of "abcde" while "aec" is not). A common subsequence of two strings is a subsequence that is common to both strings.
If there is no common subsequence, return 0.
Example 1:
Input: text1 = "abcde", text2 = "ace" Output: 3 Explanation: The longest common subsequence is "ace" and its length is 3.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 | func longestCommonSubsequence(text1 string, text2 string) int { if text1 == text2 { return len(text1) } m := len(text1) n := len(text2) dp := make([][]int, m+1) for i := 0; i < len(dp); i++ { dp[i] = make([]int, n+1) } for i := 1; i <= m; i++ { for j := 1; j <= n; j++ { if text1[i-1] == text2[j-1] { dp[i][j] = 1 + dp[i-1][j-1] } else { dp[i][j] = max(dp[i-1][j], dp[i][j-1]) } } } //fmt.Println("dp: ", dp) return dp[m][n]}func max(a, b int) int { if a > b { return a } return b} |
评论 (0)
