Skip to content

Commit 7ec67a4

Browse files
committed
Add cases for even/odd length of loop in LinkedList task
1 parent d0b4820 commit 7ec67a4

File tree

1 file changed

+17
-1
lines changed

1 file changed

+17
-1
lines changed

src/test/java/by/andd3dfx/collections/LoopInLinkedListTest.java

+17-1
Original file line numberDiff line numberDiff line change
@@ -23,7 +23,7 @@ public void find() {
2323
}
2424

2525
@Test
26-
public void findForListWithLoop() {
26+
public void findForListWithOddLengthLoop() {
2727
Node node1 = new Node(10);
2828
Node node2 = new Node(11, node1);
2929
Node node3 = new Node(12, node2);
@@ -38,6 +38,22 @@ public void findForListWithLoop() {
3838
assertTrue(LoopInLinkedList.isPresent(node1));
3939
}
4040

41+
@Test
42+
public void findForListWithEvenLengthLoop() {
43+
Node node1 = new Node(10);
44+
Node node2 = new Node(11, node1);
45+
Node node3 = new Node(12, node2);
46+
Node node4 = new Node(13, node3);
47+
Node node5 = new Node(14, node4);
48+
node1.setNext(node4);
49+
50+
assertTrue(LoopInLinkedList.isPresent(node5));
51+
assertTrue(LoopInLinkedList.isPresent(node4));
52+
assertTrue(LoopInLinkedList.isPresent(node3));
53+
assertTrue(LoopInLinkedList.isPresent(node2));
54+
assertTrue(LoopInLinkedList.isPresent(node1));
55+
}
56+
4157
@Test
4258
public void findForSingleNodeWithLoop() {
4359
Node head = new Node(10);

0 commit comments

Comments
 (0)