leetcode-java/src/test/java/com/leetcode/easy/LinkedListCycle141Test.java at main · kobukuro/leetcode-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
package com.leetcode.easy;

import com.leetcode.datastructure.ListNode;
import org.junit.jupiter.api.BeforeEach;
import org.junit.jupiter.api.Test;

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

public class LinkedListCycle141Test {
    private LinkedListCycle141 solution;

    @BeforeEach
    void setUp() {
        solution = new LinkedListCycle141();
    }

    @Test
    void testHasCycle_Example1() {
        ListNode head = new ListNode(3);
        head.next = new ListNode(2);
        head.next.next = new ListNode(0);
        head.next.next.next = new ListNode(-4);
        head.next.next.next.next = head.next; // Create a cycle here

        assertTrue(solution.hasCycle(head));
    }

    @Test
    void testHasCycle_Example2() {
        ListNode head = new ListNode(1);
        head.next = new ListNode(2);
        head.next.next = head; // Create a cycle here

        assertTrue(solution.hasCycle(head));
    }

    @Test
    void testHasCycle_Example3() {
        ListNode head = new ListNode(1);

        assertFalse(solution.hasCycle(head));
    }

    @Test
    void testHasCycle_Example4() {
        ListNode head = new ListNode(1);
        head.next = new ListNode(2);

        assertFalse(solution.hasCycle(head));
    }
}