-
Notifications
You must be signed in to change notification settings - Fork 104
/
Copy pathRemoveloopinLinkedList.cpp
148 lines (125 loc) · 2.22 KB
/
RemoveloopinLinkedList.cpp
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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
#include <iostream>
using namespace std;
struct Node
{
int data;
Node* next;
Node(int val)
{
data = val;
next = NULL;
}
};
void loopHere(Node* head, Node* tail, int position)
{
if(position==0) return;
Node* walk = head;
for(int i=1; i<position; i++)
walk = walk->next;
tail->next = walk;
}
bool isLoop(Node* head)
{
if(!head) return false;
Node* fast = head->next;
Node* slow = head;
while( fast != slow)
{
if( !fast || !fast->next ) return false;
fast=fast->next->next;
slow=slow->next;
}
return true;
}
int length(Node* head)
{
int ret = 0;
while(head)
{
ret++;
head = head->next;
}
return ret;
}
// } Driver Code Ends
/*
structure of linked list node:
struct Node
{
int data;
Node* next;
Node(int val)
{
data = val;
next = NULL;
}
};
*/
class Solution
{
public:
//Function to remove a loop in the linked list.
void removeLoop(Node* head)
{
Node* low=head;
Node* high=head;
while(low!=NULL and high!=NULL and high->next!=NULL)
{
low=low->next;
high=high->next->next;
if(low==high)
{
break;
}
}
if(low==head)
{
while(high->next!=low){
high=high->next;
}
high->next=NULL;
}
else
if(low==high){
low=head;
while(low->next!=high->next){
low=low->next;
high=high->next;
}
high->next=NULL;
}
// code here
// just remove the loop without losing any nodes
}
};
// { Driver Code Starts.
int main()
{
int t;
cin>>t;
while(t--)
{
int n, num;
cin>>n;
Node *head, *tail;
cin>> num;
head = tail = new Node(num);
for(int i=0 ; i<n-1 ; i++)
{
cin>> num;
tail->next = new Node(num);
tail = tail->next;
}
int pos;
cin>> pos;
loopHere(head,tail,pos);
Solution ob;
ob.removeLoop(head);
if( isLoop(head) || length(head)!=n )
cout<<"0\n";
else
cout<<"1\n";
}
return 0;
}
// } Driver Code Ends