Przejdź do treści

Odległość Levenshteina (edycyjna)

Opis problemu

Implementacja

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
#include <iostream>

using namespace std;

int levenshteinDistance(string a, string b) {
    int matrix[a.length() + 1][b.length() + 1] = {};
    int cost;

    for (int i = 1; i <= a.length(); i++) {
        for (int j = 1; j <= b.length(); j++) {
            if (a[i - 1] == b[j - 1]) {
                cost = 0;
            } else {
                cost = 1;
            }

            matrix[i][j] = min(matrix[i - 1][j - 1] + cost, min(matrix[i - 1][j] + 1, matrix[i][j - 1] + 1));
        }
    }

    return matrix[a.length()][b.length()];
}

int main() {
    string a = "kitten";
    string b = "sitting";

    int distance = levenshteinDistance(a, b);

    cout << distance << endl;

    return 0;
}