/
LevenshteinDistanceTest.java
49 lines (40 loc) · 1.31 KB
/
LevenshteinDistanceTest.java
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
package com.algorithm.distance;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.junit.runners.Parameterized;
import java.util.Arrays;
import java.util.Collection;
import static org.junit.Assert.*;
/**
* @author tomining
*/
@RunWith(Parameterized.class)
public class LevenshteinDistanceTest {
@Parameterized.Parameters
public static Collection<Object[]> parameters() {
return Arrays.asList(new Object[][] {
{"kitten", "sitting", 3}
});
}
private String first;
private String second;
private int levenshteinDistance;
public LevenshteinDistanceTest(String first, String second, int levenshteinDistance) {
this.first = first;
this.second = second;
this.levenshteinDistance = levenshteinDistance;
}
private LevenshteinDistance levenshtein = new LevenshteinDistance();
@Test
public void getDistanceByRecursive() {
int i = this.first.length();
int j = this.second.length();
int distance = levenshtein.getDistance(this.first, i, this.second, j);
assertEquals(levenshteinDistance, distance);
}
@Test
public void getDistanceByFullMatrix() {
int distance = levenshtein.getDistance(this.first, this.second);
assertEquals(levenshteinDistance, distance);
}
}