-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLinkedList2.cpp
84 lines (73 loc) · 1.43 KB
/
LinkedList2.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
// https://practice.geeksforgeeks.org/problems/detect-loop-in-linked-list/1/
// Remove Linked List Loop
#include <bits/stdc++.h>
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 detectLoop(Node *head);
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);
if (detectLoop(head))
cout << "True\n";
else
cout << "False\n";
}
return 0;
}
bool detectLoop(Node *head)
{
Node *slow, *fast;
slow = fast = head;
bool flag = false;
while (fast != NULL and slow != NULL)
{
slow = slow->next;
fast = (fast->next);
if (fast == NULL)
{
break;
}
fast = fast->next;
if (fast == slow)
{
flag = true;
break;
}
}
return flag;
}