int n1 = word1.size();

int n2 = word2.size();

if (n1==0) return n2;

if (n2==0) return n1;

vector< vector<int> > m(n1+1);

for(int i=0; i<m.size(); i++){

vector<int> r(n2+1);

r[0] = i;

m[i] = r;

}

for (int i=0; i<m[0].size(); i++) {

m[0][i]=i;

}

//Dynamic Programming

for (row=1; row<m.size(); row++) {

for(col=1; col<m[row].size(); col++){

if (word1[row-1] == word2[col-1] ){

m[row][col] = m[row-1][col-1];

}else{

int minValue = min(m[row-1][col-1], m[row-1][col]);

minValue = min(minValue, m[row][col-1]);

m[row][col] = minValue + 1;

}

}

}

return m[row-1][col-1];

{

string word1="abb", word2="abccb";

if (argc>2){

word1 = argv[1];

word2 = argv[2];

}

int steps = minDistance(word1, word2);

cout << word1 << ", " << word2 << " : " << steps << endl;

return 0;