youngyangyang04 / leetcode-master-comment

用来做评论区
0 stars 0 forks source link

[Vssue]1143.最长公共子序列.md #143

Open youngyangyang04 opened 3 weeks ago

youngyangyang04 commented 3 weeks ago

https://www.programmercarl.com/1143.%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97.html

Du1in9 commented 5 days ago
// 例: text1 = "abcde", text2 = "ace"
i = 1:  j = 1: 满足 'a' == 'a', 则 dp[1][1] = 0+1 = 1 (子序列 "a")
    j = 2: 不满足 'a' == 'c', 则 dp[1][2] = max(0,1) = 1 (子序列 "a")
    j = 3: 不满足 'a' == 'e', 则 dp[1][3] = max(0,1) = 1 (子序列 "a")
i = 2:  j = 1: 不满足 'b' == 'a', 则 dp[2][1] = max(1,0) = 1 (子序列 "a")
    j = 2: 不满足 'b' == 'c', 则 dp[2][2] = max(1,1) = 1 (子序列 "a")
    j = 3: 不满足 'b' == 'e', 则 dp[2][3] = max(1,1) = 1 (子序列 "a")
i = 3:  j = 1: 不满足 'c' == 'a', 则 dp[3][1] = max(1,0) = 1 (子序列 "a")
    j = 2: 满足 'c' == 'c', 则 dp[3][2] = 1+1 = 2 (子序列 "ac")
    j = 3: 不满足 'e' == 'e', 则 dp[3][3] = max(1,2) = 2 (子序列 "ac")
i = 4:  j = 1: 不满足 'd' == 'a', 则 dp[4][1] = max(1,0) = 1 (子序列 "a")
    j = 2: 不满足 'd' == 'c', 则 dp[4][2] = max(2,1) = 2 (子序列 "ac")
    j = 3: 不满足 'd' == 'e', 则 dp[4][3] = max(2,2) = 2 (子序列 "ac")
i = 5:  j = 1: 不满足 'e' == 'a', 则 dp[5][1] = max(1,0) = 1 (子序列 "a")
    j = 2: 不满足 'e' == 'c', 则 dp[5][2] = max(2,1) = 2 (子序列 "ac")
    j = 3: 满足 'e' == 'e', 则 dp[5][3] = 2+1 = 3 (子序列 "ace")