python C++遞迴邁向dp動態規劃解Leetcode 1143 Longest Common Subsequence

python C++遞迴邁向dp動態規劃解Leetcode 1143  Longest Common Subsequence. LCS之類的問題其實跟 DNA 序列的比對問題密切關聯。非常經典的DP動態規劃問題，有的人會TLE，請注意不是只設cache就好，尤其是C++，字串不要call-by-value 

[codes on Leetcode]https://leetcode.com/problems/longest-common-subsequence/solutions/4622077/recursion-dp-iteration-w-optimized-sc-o-n-11-ms-beats-99-60/

[Leetcode playList]https://www.youtube.com/watch?v=KHVXYo7LxZE&list=PLYRlUBnWnd5IdDHk2BjqXwesydU17z_xk

[Dynamic Programming Playlist]https://www.youtube.com/watch?v=30yq3fmE6E8&list=PLYRlUBnWnd5K_XYUesV9oc6M9ONXII61T