-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathGFG_RotateLinkedList.cpp
107 lines (84 loc) · 1.64 KB
/
GFG_RotateLinkedList.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
/* https://practice.geeksforgeeks.org/problems/rotate-a-linked-list/1
* Reverse Linked List
*/
// { Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
struct Node {
int data;
struct Node *next;
Node(int x) {
data = x;
next = NULL;
}
};
// } Driver Code Ends
/*
struct Node {
int data;
struct Node *next;
Node(int x) {
data = x;
next = NULL;
}
};
*/
class Solution
{
public:
//Function to rotate a linked list.
Node* rotate(Node* head, int k)
{
Node* ptr = head, *prev = nullptr;
Node* oldHead = head;
while(k--)
{
prev = ptr;
ptr = ptr->next;
}
if(prev->next == nullptr) return oldHead;
prev->next = nullptr;
head = ptr;
while(ptr->next)
{
ptr = ptr->next;
}
ptr->next = oldHead;
return head;
}//end
};
// { Driver Code Starts.
void printList(Node *n)
{
while (n != NULL)
{
cout<< n->data << " ";
n = n->next;
}
cout<< endl;
}
int main()
{
int t;
cin>>t;
while(t--)
{
int n, val, k;
cin>>n;
cin>> val;
Node *head = new Node(val);
Node *tail = head;
for(int i=0; i<n-1; i++)
{
cin>> val;
tail->next = new Node(val);
tail = tail->next;
}
cin>> k;
Solution ob;
head = ob.rotate(head,k);
printList(head);
}
return 1;
}
// } Driver Code Ends