-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCheck If Circular Linked List.cpp
83 lines (70 loc) · 1.33 KB
/
Check If Circular Linked List.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
//{ Driver Code Starts
// C program to find n'th Node in linked list
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
using namespace std;
/* Link list Node */
struct Node
{
int data;
struct Node *next;
Node(int x)
{
data = x;
next = NULL;
}
};
/* Function to get the middle of the linked list*/
bool isCircular(struct Node *head);
/* Driver program to test above function*/
int main()
{
int T, i, n, l, k;
cin >> T;
while (T--)
{
cin >> n >> k;
Node *head = NULL, *tail = NULL;
int x;
cin >> x;
head = new Node(x);
tail = head;
for (int i = 0; i < n - 1; i++)
{
cin >> x;
tail->next = new Node(x);
tail = tail->next;
}
if (k == 1 && n >= 1)
tail->next = head;
printf("%d\n", isCircular(head));
}
return 0;
}
// } Driver Code Ends
/* Link list Node
struct Node
{
int data;
struct Node* next;
Node(int x){
data = x;
next = NULL;
}
};
*/
/* Should return true if linked list is circular, else false */
bool isCircular(Node *head)
{
Node *temp = head;
while (temp != NULL)
{
if (temp->next == head)
{
return 1;
}
temp = temp->next;
}
return 0;
}