-
Notifications
You must be signed in to change notification settings - Fork 19.8k
/
Copy pathArrayLeftRotation.java
44 lines (37 loc) · 1.18 KB
/
ArrayLeftRotation.java
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
package com.thealgorithms.others;
/**
* Provides a method to perform a left rotation on an array.
* A left rotation operation shifts each element of the array
* by a specified number of positions to the left.
*
* @author sangin-lee
*/
public final class ArrayLeftRotation {
private ArrayLeftRotation() {
}
/**
* Performs a left rotation on the given array by the specified number of positions.
*
* @param arr the array to be rotated
* @param n the number of positions to rotate the array to the left
* @return a new array containing the elements of the input array rotated to the left
*/
public static int[] rotateLeft(int[] arr, int n) {
int size = arr.length;
// Handle cases where array is empty or rotation count is zero
if (size == 0 || n <= 0) {
return arr.clone();
}
// Normalize the number of rotations
n = n % size;
if (n == 0) {
return arr.clone();
}
int[] rotated = new int[size];
// Perform rotation
for (int i = 0; i < size; i++) {
rotated[i] = arr[(i + n) % size];
}
return rotated;
}
}