forked from geekcomputers/Python
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDetect_Remove_loop.py
65 lines (57 loc) · 1.75 KB
/
Detect_Remove_loop.py
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
class Node:
def __init__(self, data):
self.data = data
self.next = None
class Linked_List:
def __init__(self):
self.head = None
def Insert_At_End(self, new_data):
new_node = Node(new_data)
if self.head is None:
self.head = new_node
return
current = self.head
while current.next:
current = current.next
current.next = new_node
def Detect_and_Remove_Loop(self):
slow = fast = self.head
while slow and fast and fast.next:
slow = slow.next
fast = fast.next.next
if slow == fast:
self.Remove_loop(slow)
print("Loop Found")
return 1
return 0
def Remove_loop(self, Loop_node):
ptr1 = self.head
while 1:
ptr2 = Loop_node
while ptr2.next != Loop_node and ptr2.next != ptr1:
ptr2 = ptr2.next
if ptr2.next == ptr1:
break
ptr1 = ptr1.next
ptr2.next = None
def Display(self):
temp = self.head
while temp:
print(temp.data, "->", end=" ")
temp = temp.next
print("None")
if __name__ == "__main__":
L_list = Linked_List()
L_list.Insert_At_End(8)
L_list.Insert_At_End(5)
L_list.Insert_At_End(10)
L_list.Insert_At_End(7)
L_list.Insert_At_End(6)
L_list.Insert_At_End(11)
L_list.Insert_At_End(9)
print("Linked List with Loop: ")
L_list.Display()
print("Linked List without Loop: ")
L_list.head.next.next.next.next.next.next.next = L_list.head.next.next
L_list.Detect_and_Remove_Loop()
L_list.Display()