https://leetcode.com/problems/edit-distance/?tab=Description 真的非常好,也非常典型. https://discuss.leetcode.com/topic/17639/20ms-detailed-explained-c-solutions-o-n-space dp[i][] = i; dp[][j] = j; dp[i][j] = dp[i - ][j - ], ] = word2[j - ]; dp[i][j] = min(dp[i…