[{"language":"Java","code":"public class Solution {\n    public void removeCycle(ListNode head) {\n        ListNode slow = head, fast = head;\n\n        // Step 1: Detect cycle using Floyd’s Tortoise and Hare Algorithm\n        while (fast != null && fast.next != null) {\n            slow = slow.next;\n            fast = fast.next.next;\n\n            if (slow == fast) { // Cycle detected\n                breakCycle(head, slow);\n                return;\n            }\n        }\n    }\n\n    private void breakCycle(ListNode head, ListNode meetingPoint) {\n        ListNode start = head;\n        ListNode cycleNode = meetingPoint;\n\n        // Step 2: Find the entry point of the cycle\n        while (start != cycleNode) {\n            start = start.next;\n            cycleNode = cycleNode.next;\n        }\n\n        // Step 3: Find the last node in the cycle and break the cycle\n        ListNode lastNode = cycleNode;\n        while (lastNode.next != cycleNode) {\n            lastNode = lastNode.next;\n        }\n        lastNode.next = null; // Remove the cycle\n    }\n\n    // Helper function to create a cycle for testing\n    public void createCycle(ListNode head, int pos) {\n        if (pos == -1)\n            return;\n        ListNode tail = head, cycleEntry = null;\n        int index = 0;\n        while (tail.next != null) {\n            if (index == pos) {\n                cycleEntry = tail;\n            }\n            tail = tail.next;\n            index++;\n        }\n        tail.next = cycleEntry; // Create the cycle\n    }\n\n    // Helper function to print the linked list\n    public void printLinkedList(ListNode head) {\n        ListNode current = head;\n        while (current != null) {\n            System.out.print(current.val + \" -> \");\n            current = current.next;\n        }\n        System.out.println(\"None\");\n    }\n\n    // Helper function to create a linked list from an array\n    public ListNode createLinkedList(int[] arr) {\n        if (arr.length == 0)\n            return null;\n        ListNode dummy = new ListNode(0);\n        ListNode current = dummy;\n        for (int value : arr) {\n            current.next = new ListNode(value);\n            current = current.next;\n        }\n        return dummy.next;\n    }\n\n    public static void main(String[] args) {\n        Solution solution = new Solution();\n\n        int[] arr1 = {3, 2, 0, -4};\n        ListNode head1 = solution.createLinkedList(arr1);\n        solution.createCycle(head1, 1);\n        System.out.println(\"Linked List with Cycle:\");\n        solution.printLinkedList(\n            head1); // This will print indefinitely if there is a cycle\n\n        solution.removeCycle(head1);\n        System.out.println(\"Linked List after removing Cycle:\");\n        solution.printLinkedList(head1);\n    }\n}","lang":"java","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">public</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> class</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> Solution</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">    public</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> void</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> removeCycle</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(ListNode </span><span style=\"color:#E36209;--shiki-dark:#FFAB70\">head</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">) {</span></span>\n<span class=\"line\"><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">        ListNode slow </span><span style=\"color:#D73A49;--shiki-d
Related Tags
