matrix[i] = new int[str2.length + 1];
}
matrix[0][0] = 0;
for(i = 1; i < str2.length + 1; ++ i)
matrix[0][i] = matrix[0][i - 1] + cost_insert;
for(j = 1; j < str1.length + 1; ++ j)
matrix[j][0] = matrix[j - 1][0] + cost_delete;
for(i = 1; i < str1.length + 1; ++ i)
{
for(j = 1; j < str2.length + 1; ++ j) {
int v1, v2, v3;
v1 = matrix[i][j - 1] + cost_insert;
v2 = matrix[i - 1][j] + cost_delete;
if (str1[i-1] == str2[j-1]) {
v3 = matrix[i - 1][j - 1] + cost_match;
} else {