algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-28 15:02:46 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add Array Left Rotation (#2869)

Browse Source
This commit is contained in:
sangin-lee
2021-12-12 01:54:12 +09:00
committed by GitHub
parent 0bb7db2d87
commit 734f7a4a04
2 changed files with 81 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
src/test/java/com/thealgorithms/others/ArrayLeftRotationTest.java Normal file
View File

@ -0,0 +1,48 @@
package com.thealgorithms.others;
import org.junit.jupiter.api.Test;
import static org.junit.jupiter.api.Assertions.*;
class ArrayLeftRotationTest {
@Test
void testForOneElement() {
int[] arr = {3};
int[] result = ArrayLeftRotation.rotateLeft(arr, 3);
assertArrayEquals(arr, result);
}
@Test
void testForZeroStep() {
int[] arr = {3, 1, 5, 8, 6};
int[] result = ArrayLeftRotation.rotateLeft(arr, 0);
assertArrayEquals(arr, result);
}
@Test
void testForEqualSizeStep() {
int[] arr = {3, 1, 5, 8, 6};
int[] result = ArrayLeftRotation.rotateLeft(arr, 5);
assertArrayEquals(arr, result);
}
@Test
void testForLowerSizeStep() {
int[] arr = {3, 1, 5, 8, 6};
int n = 2;
int[] expected = {5, 8, 6, 3, 1};
int[] result = ArrayLeftRotation.rotateLeft(arr, n);
assertArrayEquals(expected, result);
}
@Test
void testForHigherSizeStep() {
int[] arr = {3, 1, 5, 8, 6};
int n = 7;
int[] expected = {5, 8, 6, 3, 1};
int[] result = ArrayLeftRotation.rotateLeft(arr, n);
assertArrayEquals(expected, result);
}
}