检测链表（Check list）.docVIP

检测链表（Check list） How do I check if there is a ring on a one-way list? 2011-06-08 11:12, 638 people read comments (1) collection report There is a single list, which may have a ring, that is, the next of a node points to the node before it in the list, so that a loop is formed at the tail of the list. Question: 1, how to judge a list is not this kind of linked list? 2, if the list is the existence ring, if we find the entry point of the ring? Answer： 1, the most simple, with a pointer traversing the list, every node of his memory address (Java) can be used as key (object.hashcode) in a hashtable. So when repeated key instructions in hashtable ring this list. This time the degree of O (n), O (n) for the same space. 2, the use of inverted pointer method, each node, the node pointer reversal: [cpp:collapse] + expand sourceview plaincopy It is a strange way: when the ring inversion of the next pointer will eventually come to the list head; when no ring inversion next pointer will destroy the list structure (the list, so we need to reverse the list) and then reverse again. This method the space complexity is O (1). In fact we use 3 additional pointers; and the time complexity is O (n), we traverse the list (up to 2 times when there is no ring when the list). The biggest disadvantage of this method is not safe in a multi-threaded case, when multiple threads are read in this list, check ring thread will change the list, though we restored the structure itself, but can not guarantee that other threads can get the correct results. 3, this is the general interviewers expected answer: fast pointer and slow pointer Set two pointer (fast, slow), the initial value of all point to the head, step two step forward fast slow every time, every time, if there is list ring, fast must be advanced into the ring, and slow after entering the ring, the two pointer must meet. (of course, fast goes first to the tail, and NULL to the acyclic list.) [c-sharp] view plaincopy Int is_link_list_cicle