-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathChecking loop on singly linked list.java
More file actions
91 lines (77 loc) · 1.58 KB
/
Checking loop on singly linked list.java
File metadata and controls
91 lines (77 loc) · 1.58 KB
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
import java.util.*;
class Node
{
int data;
Node next;
public Node(int data)
{
this.data=data;
this.next=null;
}
}
class Linkedlist
{
Node head;
public Linkedlist()
{
this.head=null;
}
public void append(int data)
{
Node newnode=new Node(data);
if(head==null)
{
this.head=newnode;
return;
}
Node lastnode=this.head;
while(lastnode.next!=null)
{
lastnode=lastnode.next;
}
lastnode.next=newnode;
}
public void chk_loop()
{
Node hare,tort;
hare=tort=this.head;
if(this.head==null)
{
System.out.println("List is empty...");
}
else
{
while(hare!=null && hare.next!=null)
{
tort=tort.next;
hare=hare.next.next;
if(hare==tort)
{
System.out.println("Loop is there...");
return;
}
}
System.out.println("Loop is not there...");
}
}
public void printlist()
{
Node curr=this.head;
while(curr!=null)
{
System.out.println(curr.data);
curr=curr.next;
}
}
}
public class Main
{
public static void main(String args[])
{
Linkedlist l=new Linkedlist();
for(int i=1;i<6;i++)
l.append(i);
l.printlist();
l.chk_loop();
}
}