Java/src/test/java/com/thealgorithms/misc/PalindromeSinglyLinkedListTest.java at master · Shewale41/Java · GitHub

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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
package com.thealgorithms.misc;

import static org.junit.jupiter.api.Assertions.assertFalse;
import static org.junit.jupiter.api.Assertions.assertTrue;

import com.thealgorithms.datastructures.lists.SinglyLinkedList;
import org.junit.jupiter.api.Test;

public class PalindromeSinglyLinkedListTest {

    // Stack-based tests
    @Test
    public void testWithEmptyList() {
        assertTrue(PalindromeSinglyLinkedList.isPalindrome(new SinglyLinkedList()));
    }

    @Test
    public void testWithSingleElement() {
        var exampleList = new SinglyLinkedList();
        exampleList.insert(100);
        assertTrue(PalindromeSinglyLinkedList.isPalindrome(exampleList));
    }

    @Test
    public void testWithListWithOddLengthPositive() {
        var exampleList = new SinglyLinkedList();
        exampleList.insert(1);
        exampleList.insert(2);
        exampleList.insert(1);
        assertTrue(PalindromeSinglyLinkedList.isPalindrome(exampleList));
    }

    @Test
    public void testWithListWithOddLengthPositive2() {
        var exampleList = new SinglyLinkedList();
        exampleList.insert(3);
        exampleList.insert(2);
        exampleList.insert(1);
        exampleList.insert(2);
        exampleList.insert(3);
        assertTrue(PalindromeSinglyLinkedList.isPalindrome(exampleList));
    }

    @Test
    public void testWithListWithEvenLengthPositive() {
        var exampleList = new SinglyLinkedList();
        exampleList.insert(10);
        exampleList.insert(20);
        exampleList.insert(20);
        exampleList.insert(10);
        assertTrue(PalindromeSinglyLinkedList.isPalindrome(exampleList));
    }

    @Test
    public void testWithListWithOddLengthNegative() {
        var exampleList = new SinglyLinkedList();
        exampleList.insert(1);
        exampleList.insert(2);
        exampleList.insert(2);
        assertFalse(PalindromeSinglyLinkedList.isPalindrome(exampleList));
    }

    @Test
    public void testWithListWithEvenLengthNegative() {
        var exampleList = new SinglyLinkedList();
        exampleList.insert(10);
        exampleList.insert(20);
        exampleList.insert(20);
        exampleList.insert(20);
        assertFalse(PalindromeSinglyLinkedList.isPalindrome(exampleList));
    }

    // Optimized approach tests
    @Test
    public void testOptimisedWithEmptyList() {
        assertTrue(PalindromeSinglyLinkedList.isPalindromeOptimised(null));
    }

    @Test
    public void testOptimisedWithSingleElement() {
        PalindromeSinglyLinkedList.Node node = new PalindromeSinglyLinkedList.Node(100);
        assertTrue(PalindromeSinglyLinkedList.isPalindromeOptimised(node));
    }

    @Test
    public void testOptimisedWithOddLengthPositive() {
        PalindromeSinglyLinkedList.Node node1 = new PalindromeSinglyLinkedList.Node(1);
        PalindromeSinglyLinkedList.Node node2 = new PalindromeSinglyLinkedList.Node(2);
        PalindromeSinglyLinkedList.Node node3 = new PalindromeSinglyLinkedList.Node(1);
        node1.next = node2;
        node2.next = node3;
        assertTrue(PalindromeSinglyLinkedList.isPalindromeOptimised(node1));
    }

    @Test
    public void testOptimisedWithOddLengthPositive2() {
        PalindromeSinglyLinkedList.Node node1 = new PalindromeSinglyLinkedList.Node(3);
        PalindromeSinglyLinkedList.Node node2 = new PalindromeSinglyLinkedList.Node(2);
        PalindromeSinglyLinkedList.Node node3 = new PalindromeSinglyLinkedList.Node(1);
        PalindromeSinglyLinkedList.Node node4 = new PalindromeSinglyLinkedList.Node(2);
        PalindromeSinglyLinkedList.Node node5 = new PalindromeSinglyLinkedList.Node(3);
        node1.next = node2;
        node2.next = node3;
        node3.next = node4;
        node4.next = node5;
        assertTrue(PalindromeSinglyLinkedList.isPalindromeOptimised(node1));
    }

    @Test
    public void testOptimisedWithEvenLengthPositive() {
        PalindromeSinglyLinkedList.Node node1 = new PalindromeSinglyLinkedList.Node(10);
        PalindromeSinglyLinkedList.Node node2 = new PalindromeSinglyLinkedList.Node(20);
        PalindromeSinglyLinkedList.Node node3 = new PalindromeSinglyLinkedList.Node(20);
        PalindromeSinglyLinkedList.Node node4 = new PalindromeSinglyLinkedList.Node(10);
        node1.next = node2;
        node2.next = node3;
        node3.next = node4;
        assertTrue(PalindromeSinglyLinkedList.isPalindromeOptimised(node1));
    }

    @Test
    public void testOptimisedWithOddLengthNegative() {
        PalindromeSinglyLinkedList.Node node1 = new PalindromeSinglyLinkedList.Node(1);
        PalindromeSinglyLinkedList.Node node2 = new PalindromeSinglyLinkedList.Node(2);
        PalindromeSinglyLinkedList.Node node3 = new PalindromeSinglyLinkedList.Node(2);
        node1.next = node2;
        node2.next = node3;
        assertFalse(PalindromeSinglyLinkedList.isPalindromeOptimised(node1));
    }

    @Test
    public void testOptimisedWithEvenLengthNegative() {
        PalindromeSinglyLinkedList.Node node1 = new PalindromeSinglyLinkedList.Node(10);
        PalindromeSinglyLinkedList.Node node2 = new PalindromeSinglyLinkedList.Node(20);
        PalindromeSinglyLinkedList.Node node3 = new PalindromeSinglyLinkedList.Node(20);
        PalindromeSinglyLinkedList.Node node4 = new PalindromeSinglyLinkedList.Node(20);
        node1.next = node2;
        node2.next = node3;
        node3.next = node4;
        assertFalse(PalindromeSinglyLinkedList.isPalindromeOptimised(node1));
    }
}