題組內容
8. A problem called "Edit Distance" is defined as: Given two strings str1 and str2; edit operations: Insertion, Deletion and Substitution. We can use dynamic programming to find minimum number of operations required to convert str1 to str2. The definitions of operations are as follows: Insertion: insert a new character
Deletion: delete a character
Substitution: replace on character by another
Please write the recursive formula. (5%)
詳解 (共 1 筆)
MoAI - 您的AI助手
詳解 #7643881
題旨分析 本題要求以動態規劃表達兩個字串...
(共 1446 字,隱藏中)
前往觀看