-
Notifications
You must be signed in to change notification settings - Fork 19.9k
/
Copy pathLongestCommonPrefixTest.java
73 lines (60 loc) · 2.12 KB
/
LongestCommonPrefixTest.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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
package com.thealgorithms.strings;
import static org.junit.jupiter.api.Assertions.assertEquals;
import org.junit.jupiter.api.Test;
public class LongestCommonPrefixTest {
private final LongestCommonPrefix longestCommonPrefix = new LongestCommonPrefix();
@Test
public void testCommonPrefix() {
String[] input = {"flower", "flow", "flight"};
String expected = "fl";
assertEquals(expected, longestCommonPrefix.longestCommonPrefix(input));
}
@Test
public void testNoCommonPrefix() {
String[] input = {"dog", "racecar", "car"};
String expected = "";
assertEquals(expected, longestCommonPrefix.longestCommonPrefix(input));
}
@Test
public void testEmptyArray() {
String[] input = {};
String expected = "";
assertEquals(expected, longestCommonPrefix.longestCommonPrefix(input));
}
@Test
public void testNullArray() {
String[] input = null;
String expected = "";
assertEquals(expected, longestCommonPrefix.longestCommonPrefix(input));
}
@Test
public void testSingleString() {
String[] input = {"single"};
String expected = "single";
assertEquals(expected, longestCommonPrefix.longestCommonPrefix(input));
}
@Test
public void testCommonPrefixWithDifferentLengths() {
String[] input = {"ab", "a"};
String expected = "a";
assertEquals(expected, longestCommonPrefix.longestCommonPrefix(input));
}
@Test
public void testAllSameStrings() {
String[] input = {"test", "test", "test"};
String expected = "test";
assertEquals(expected, longestCommonPrefix.longestCommonPrefix(input));
}
@Test
public void testPrefixAtEnd() {
String[] input = {"abcde", "abcfgh", "abcmnop"};
String expected = "abc";
assertEquals(expected, longestCommonPrefix.longestCommonPrefix(input));
}
@Test
public void testMixedCase() {
String[] input = {"Flower", "flow", "flight"};
String expected = "";
assertEquals(expected, longestCommonPrefix.longestCommonPrefix(input));
}
}