FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
cpp/F12Array-2/RotateArray.cpp at main · roydevashish/cpp · GitHub
roydevashish
/
cpp
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
cpp
/
F12Array-2
/
RotateArray.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
95 lines (73 loc) · 1.87 KB
Breadcrumbs
cpp
/
F12Array-2
/
RotateArray.cpp
Copy path
File metadata and controls
95 lines (73 loc) · 1.87 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
/*
Title: Rotate Array
Problem statement
You have been given a random integer array/list(ARR) of size N. Write a function that rotates the
given array/list by D elements(towards the left).
Note:
Change in the input array/list itself.You don't need to return or print the elements.
Detailed explanation ( Input/output format, Notes, Images )
Input format :
The first line contains an Integer 't' which denotes the number of test cases or queries to be run.
Then the test cases follow.
First line of each test case or query contains an integer 'N' representing the size of the array/list.
Second line contains 'N' single space separated integers representing the elements in the array/list.
Third line contains the value of 'D' by which the array/list needs to be rotated.
Output Format :
For each test case, print the rotated array/list in a row separated by a single space.
Output for every test case will be printed in a separate line.
Constraints :
1 <= t <= 10^4
0 <= N <= 10^6
0 <= D <= N
Time Limit: 1 sec
Sample Input 1:
1
7
1 2 3 4 5 6 7
2
Sample Output 1:
3 4 5 6 7 1 2
Sample Input 2:
2
7
1 2 3 4 5 6 7
0
4
1 2 3 4
2
Sample Output 2:
1 2 3 4 5 6 7
3 4 1 2
*/
#
include
<
iostream
>
using
namespace
std
;
void
RotateArray
(
int
array[],
int
d,
int
size) {
//
Left Rotate
while
(d--) {
int
temp_0 = array[
0
];
for
(
int
i =
1
; i < size; i++) {
array[i-
1
] = array[i];
}
array[size-
1
] = temp_0;
}
return
;
}
int
main
() {
int
t;
cin >> t;
for
(
int
test_case =
0
; test_case < t; test_case++) {
int
size, d;
cin >> size;
int
array[size];
for
(
int
i =
0
; i < size; i++) {
cin >> array[i];
}
cin >> d;
RotateArray
(array, d, size);
for
(
int
i =
0
; i < size; i++) {
cout << array[i] <<
"
"
;
}
cout << endl;
}
return
0
;
}
Back
|
FazBrowse Home
|
New Git URL