</pre>【题目】<p></p><p>判断单链表是否有环,若有环,则返回结环节点。</p><p>1.判断单链表是否有环</p><p>【思路】</p><p>判断单链表是否有环,设计一快一慢两个指针,快指针每次走两步,慢指针每次一步,遍历链表,若快指针与慢指针相遇,则表明链表有环,否则说明链表无环。</p><p>Java中先设计一个节点类(使用泛型定义):
</p><p></p><pre name="code" class="java">public class Node<T> {
public T data;
public Node<T> next;
public Node() {
super();
}
public Node(T data) {
super();
this.data = data;
}
}
再创建一个链表类,头结点为head,设计一个isRing()类,定义fast和slow两个节点对象,若fast和fast.next均不为null,则将fast指向它下一个的下一个节点,slow指向它下一个节点,判断fast==slow,若等于,则返回true,若最后fast或fast.next为null,则跳出循环,返回false,以此来判断此链表是否为环:
public class NodeList<T> {
public Node<T> head;
public NodeList() {
super();
}
public NodeList(Node<T> head) {
super();
this.head = head;
}
/**
<span> </span> * 判断单链表是否为环
<span> </span> * @return
<span> </span> */
<span> </span>public boolean isRing() {
<span> </span>Node<T> fast = head;
<span> </span>Node<T> slow = head;
<span> </span>while(fast != null && fast.next != null) {
<span> </span>fast = fast.next.next;
<span> </span>slow = slow.next;
<span> </span>if(fast == slow) {
<span> </span>return true;
<span> </span>}
<span> </span>}
<span> </span>
<span> </span>return false;
<span> </span>}
}
2.寻找单链表的结环节点
【思路】
设计三个指针,前两个指针一快一慢,快指针每次走两步,若这两指针不相遇,则直接返回null,若相遇,则此时从链表head开始移动另一个指针,每次也走一步,慢指针同时移动,这两个指针相遇的节点就是链表结环的节点,先贴代码,再解释:
<span style="white-space:pre"> </span>/**
* 寻找链表结环处的节点
* @return
*/
public Node<T> getRingNode() {
Node<T> fast = head;
Node<T> slow = head;
Node<T> newNode = head;
while(fast != null && fast.next != null) {
fast = fast.next.next;
slow = slow.next;
if(fast == slow) {
while(slow != null) {
if(newNode == slow) {
return newNode;
}
newNode = newNode.next;
slow = slow.next;
}
}
}
return null;
}
上面我们已经知道当fast和slow指针相遇时候,由于fast每次走两步,slow每次走一步,所以fast的步长一定是slow指针的步长的两倍,相遇后slow继续移动,移动到结环节点的位置的距离就一定等于从头节点到结环点的距离。