mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-12-19 07:00:35 +08:00
* Create ArrayRightRotationTest.java * Create ArrayRightRotation.java * The updated one * The updated one * Added the test cases * Added new test cases! * Update ArrayRightRotation.java * Update ArrayRightRotationTest.java
54 lines
1.6 KiB
Java
54 lines
1.6 KiB
Java
package com.thealgorithms.others;
|
|
|
|
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
|
|
|
|
import org.junit.jupiter.api.Test;
|
|
|
|
class ArrayRightRotationTest {
|
|
|
|
@Test
|
|
void testArrayRightRotation() {
|
|
int[] arr = {1, 2, 3, 4, 5, 6, 7};
|
|
int k = 3;
|
|
int[] expected = {5, 6, 7, 1, 2, 3, 4};
|
|
int[] result = ArrayRightRotation.rotateRight(arr, k);
|
|
assertArrayEquals(expected, result);
|
|
}
|
|
|
|
@Test
|
|
void testArrayRightRotationWithZeroSteps() {
|
|
int[] arr = {1, 2, 3, 4, 5, 6, 7};
|
|
int k = 0;
|
|
int[] expected = {1, 2, 3, 4, 5, 6, 7};
|
|
int[] result = ArrayRightRotation.rotateRight(arr, k);
|
|
assertArrayEquals(expected, result);
|
|
}
|
|
|
|
@Test
|
|
void testArrayRightRotationWithEqualSizeSteps() {
|
|
int[] arr = {1, 2, 3, 4, 5, 6, 7};
|
|
int k = arr.length;
|
|
int[] expected = {1, 2, 3, 4, 5, 6, 7};
|
|
int[] result = ArrayRightRotation.rotateRight(arr, k);
|
|
assertArrayEquals(expected, result);
|
|
}
|
|
|
|
@Test
|
|
void testArrayRightRotationWithLowerSizeSteps() {
|
|
int[] arr = {1, 2, 3, 4, 5, 6, 7};
|
|
int k = 2;
|
|
int[] expected = {6, 7, 1, 2, 3, 4, 5};
|
|
int[] result = ArrayRightRotation.rotateRight(arr, k);
|
|
assertArrayEquals(expected, result);
|
|
}
|
|
|
|
@Test
|
|
void testArrayRightRotationWithHigherSizeSteps() {
|
|
int[] arr = {1, 2, 3, 4, 5, 6, 7};
|
|
int k = 10;
|
|
int[] expected = {5, 6, 7, 1, 2, 3, 4};
|
|
int[] result = ArrayRightRotation.rotateRight(arr, k);
|
|
assertArrayEquals(expected, result);
|
|
}
|
|
}
|