摘要： class Solution {public: int minDistance(string word1, string word2) { int m=word1.size(); int n=word2.size(); if(m==0)return n; if(n==0)return m; int v[501][501]; int i,j; for(i=0;i<=m;i++) { v[i][0]=i; } for(j=0;... 阅读全文