Skip to content

Instantly share code, notes, and snippets.

View marcel-goldammer's full-sized avatar
💭
💻

Marcel Goldammer marcel-goldammer

💭
💻
  • Germany
  • 07:50 (UTC +01:00)
View GitHub Profile
@marcel-goldammer
marcel-goldammer / LevenshteinIterative.java
Created February 18, 2018 11:44
Levenshtein algorithm
public class LevenshteinIterative {
public int distance(String s, String t) {
int[][] distanceMatrix = new int[s.length() + 1][t.length() + 1];
for (int i = 0; i <= s.length(); i++) {
distanceMatrix[i][0] = i;
}
for (int j = 0; j <= t.length(); j++) {

Keybase proof

I hereby claim:

  • I am marcel-goldammer on github.
  • I am marcelgoldammer (https://keybase.io/marcelgoldammer) on keybase.
  • I have a public key ASCDdnnX0ruPV8uXn5SKEjb6D0ljA5VngP6zeSXStRcqZwo

To claim this, I am signing this object: