longest_common_subsequence

  • 2022-12-14
  • 浏览 (603)

longest_common_subsequence.go 源码

package main

//最长公共子序列

func longestCommonSubsequence(text1 string, text2 string) int {
	m, n := len(text1), len(text2)
	dp := make([][]int, m+1)
	for i := range dp {
		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] = dp[i-1][j-1] + 1
			} else {
				dp[i][j] = max(dp[i][j-1], dp[i-1][j])
			}
		}
	}
	return dp[m][n]
}

你可能感兴趣的文章

coin_change

decode_ways

delete_operation_two_strings

0  赞