FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java_Fundamentals/RotateArray.java at main · devdeepak06/Java_Fundamentals · GitHub
devdeepak06
/
Java_Fundamentals
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
Java_Fundamentals
/
RotateArray.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
82 lines (74 loc) · 2.49 KB
Breadcrumbs
Java_Fundamentals
/
RotateArray.java
Copy path
File metadata and controls
82 lines (74 loc) · 2.49 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
//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.
// 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: 1sec
// 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
// Explanation for Sample Input 2:
// Since, D=0 for the first query, we simply print the elements as it is.
// For the second query, we have to rotate the array/list by 2 elements which will make the array/list look like [3, 4, 1, 2].
//
import
java
.
util
.
Scanner
;
public
class
RotateArray
{
public
static
void
rotate
(
int
[]
arr
,
int
d
) {
int
n
=
arr
.
length
;
int
[]
temp
=
new
int
[
n
];
for
(
int
i
=
0
;
i
<
n
;
i
++) {
temp
[
i
] =
arr
[
i
];
}
for
(
int
i
=
0
;
i
<
n
;
i
++) {
arr
[(
i
+
n
-
d
) %
n
] =
temp
[
i
];
}
}
public
static
void
printArray
(
int
[]
arr
) {
int
n
=
arr
.
length
;
for
(
int
i
=
0
;
i
<
n
;
i
++) {
System
.
out
.
print
(
arr
[
i
] +
" "
);
}
System
.
out
.
println
();
}
public
static
void
main
(
String
[]
args
) {
try
(
Scanner
s
=
new
Scanner
(
System
.
in
)) {
int
t
=
s
.
nextInt
();
while
(
t
>
0
) {
int
n
=
s
.
nextInt
();
int
[]
arr
=
new
int
[
n
];
for
(
int
i
=
0
;
i
<
n
;
i
++) {
arr
[
i
] =
s
.
nextInt
();
}
int
d
=
s
.
nextInt
();
rotate
(
arr
,
d
);
printArray
(
arr
);
t
--;
}
}
}
}
Back
|
FazBrowse Home
|
New Git URL