示例:检测LinkedList中的循环
class LinkedList {
// create an object of Node class
// represent the head of the linked list
Node head;
// static inner class
static class Node {
int value;
// connect each node to next node
Node next;
Node(int d) {
value = d;
next = null;
}
}
// check if loop is present
public boolean checkLoop() {
// create two references at start of LinkedList
Node first = head;
Node second = head;
while(first != null && first.next !=null) {
// move first reference by 2 nodes
first = first.next.next;
// move second reference by 1 node
second = second.next;
// if two references meet
// then there is a loop
if(first == second) {
return true;
}
}
return false;
}
public static void main(String[] args) {
// create an object of LinkedList
LinkedList linkedList = new LinkedList();
// assign values to each linked list node
linkedList.head = new Node(1);
Node second = new Node(2);
Node third = new Node(3);
Node fourth = new Node(4);
// connect each node of linked list to next node
linkedList.head.next = second;
second.next = third;
third.next = fourth;
// make loop in LinkedList
fourth.next = second;
// printing node-value
System.out.print("LinkedList: ");
int i = 1;
while (i <= 4) {
System.out.print(linkedList.head.value + " ");
linkedList.head = linkedList.head.next;
i++;
}
// call method to check loop
boolean loop = linkedList.checkLoop();
if(loop) {
System.out.println("\nThere is a loop in LinkedList.");
}
else {
System.out.println("\nThere is no loop in LinkedList.");
}
}
}
输出
LinkedList: 1 2 3 4
There is a loop in LinkedList.
在上面的示例中,我们已经用Java实现了LinkedList。我们使用了Floyd的循环查找算法来检查LinkedList中是否存在循环。
注意checkLoop()
方法中的代码。在这里,我们有两个名为first和second的变量,它们遍历LinkedList
的节点。
- 第一次 -在单个迭代中遍历2个节点
- 第二次 -在单个迭代中遍历1个节点
两个节点以不同的速度运行。因此,如果LinkedList
存在循环,他们将见面。