-
Notifications
You must be signed in to change notification settings - Fork 34
/
Copy pathDetectCircularLinkList
47 lines (36 loc) · 1.01 KB
/
DetectCircularLinkList
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
import java.util.*;
// This program is used to detect if the linklist is circular or not.
class DetectCircularLinkList {
static class Node {
int data;
Node next;
}
/*This function returns true if given linked
list is circular, else false. */
static boolean isCircular( Node head) {
if (head == null)
return true;
Node node = head.next;
while (node != null && node != head) {
node = node.next;
}
return (node == head);
}
static Node newNode(int data) {
Node temp = new Node();
temp.data = data;
temp.next = null;
return temp;
}
public static void main(String args[]) {
Node head = newNode(1);
head.next = newNode(2);
head.next.next = newNode(3);
head.next.next.next = newNode(4);
System.out.print(isCircular(head)? "Yes\n" :
"No\n" );
head.next.next.next.next = head;
System.out.print(isCircular(head)? "Yes\n" :
"No\n" );
}
}