forked from TheAlgorithms/Java
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathSuffixArrayTest.java
More file actions
44 lines (35 loc) · 1.46 KB
/
SuffixArrayTest.java
File metadata and controls
44 lines (35 loc) · 1.46 KB
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
package com.thealgorithms.strings;
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
import org.junit.jupiter.api.Test;
class SuffixArrayTest {
@Test
void testEmptyString() {
int[] result = SuffixArray.buildSuffixArray("");
assertArrayEquals(new int[] {}, result, "Empty string should return empty suffix array");
}
@Test
void testSingleCharacter() {
int[] result = SuffixArray.buildSuffixArray("a");
assertArrayEquals(new int[] {0}, result, "Single char string should return [0]");
}
@Test
void testDistinctCharacters() {
int[] result = SuffixArray.buildSuffixArray("abc");
assertArrayEquals(new int[] {0, 1, 2}, result, "Suffixes already in order for distinct chars");
}
@Test
void testBananaExample() {
int[] result = SuffixArray.buildSuffixArray("banana");
assertArrayEquals(new int[] {5, 3, 1, 0, 4, 2}, result, "Suffix array of 'banana' should be [5,3,1,0,4,2]");
}
@Test
void testStringWithDuplicates() {
int[] result = SuffixArray.buildSuffixArray("aaaa");
assertArrayEquals(new int[] {3, 2, 1, 0}, result, "Suffix array should be descending indices for 'aaaa'");
}
@Test
void testRandomString() {
int[] result = SuffixArray.buildSuffixArray("mississippi");
assertArrayEquals(new int[] {10, 7, 4, 1, 0, 9, 8, 6, 3, 5, 2}, result, "Suffix array for 'mississippi' should match expected");
}
}