演算法›Ch3 動態規劃
第 37 題/共 40 題
◀ AL 37/40
37. Longest Common Subsequence、Dynamic Programming
#AL-03-037易Longest Common SubsequenceDynamic Programming

Let dp[i][j] represent the length of the Longest Common Subsequence of strings X[1…i]X[1 \ldots i] and Y[1…j]Y[1 \ldots j]. Which of the following statements are correct?

📄 中央115
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch3 動態規劃
本章題號 · 21–40 / 40