Detect loop in a singly linked list 去Twitter面试的被问到这个问题,当时只想到了用HashMap的办法,这种办法时间复杂度O(n),空间复杂度是O(n), 更好的办法是用 FastRunner / SlowRunner approach。用两个pointer遍历链表,fast的速度是slow的两倍,如果有loop,二者一定会collide。 booleandetectLoop(LinkedListNode ...
Convert sorted Linked List to balanced BST Find length of Linked List in java Implement singly linked list in java How to check if linked list is palindrome in java Java program to reverse linked list in pairs Find start node of loop in linkedlist in java Reverse a linked list in java Fin...
Singly_Linked_List imgs detectandremove.java detectloop.java floydCycleDetection.java intersectionPoint.java intersectionPointEfficient.cpp merge_sorted_lists.cpp middle_el.java nthNodefromEnd.java pairwiseSwapNodes.java randomDelete.java readme.md removeDupliInSortedLL.java reverseSLL.java reverseSLL_...