Files
problemas-para-competicao-p…/edit-distance/src/TLE.cpp
2025-12-10 09:52:19 -03:00

32 lines
541 B
C++

#include <bits/stdc++.h>
using namespace std;
int solve(string &w1, string &w2, int i = 0, int j = 0)
{
if (i >= w1.size())
{
return w2.size() - j;
}
if (j >= w2.size())
{
return w1.size() - i;
}
if (w1[i] == w2[j])
{
return solve(w1, w2, i + 1, j + 1);
}
return min({solve(w1, w2, i + 1, j), solve(w1, w2, i + 1, j + 1), solve(w1, w2, i, j + 1)}) + 1;
}
int main()
{
int n, m;
cin >> n >> m;
string w1, w2;
cin >> w1 >> w2;
cout << solve(w1, w2) << endl;
return 0;
}