C++動態規劃DP解Leetcode 712,1143 LCS問題

C++動態規劃DP解Leetcode 712,1143 LCS問題。利用計算公式minimumDeleteSum=asciiSum(s1)+asciiSum(s2)−2×asciiSum(LCS)

LCS(Longest common subsequence)之類的問題其實跟 DNA 序列的比對問題密切關聯。就先用一般的遞迴加上記憶的動態規劃來解，要更快的演算法，那就是研究問題

-----------------------------------------

The usual process for LCS to compute the ascii sum for LCS. Use the following formula

minimumDeleteSum=asciiSum(s1)+asciiSum(s2)−2×asciiSum(LCS)

Problems like LCS (Longest common subsequence) are actually closely related to the problem of comparing DNA sequences. First use general recursion plus memory dynamic programming to solve it. If you want a faster algorithm, that is the research problem.

----------------------------------------------------

Leetcode 712. Minimum ASCII Delete Sum for Two Strings

Leetcode 1143. Longest Common Subsequence

[code on Leetcode]https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/solutions/3840645/c-several-recursive-iterative-dp-lcs-beats-94-62/

[LeetCode程式]https://www.youtube.com/watch?v=7g-E3d_Oja4&list=PLYRlUBnWnd5IdDHk2BjqXwesydU17z_xk&index=1