Created
April 19, 2016 12:05
-
-
Save mateusmarquezini/e86b2014424d9a98cd1f5913705eb646 to your computer and use it in GitHub Desktop.
CyclicRotation - Codility
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* A zero-indexed array A consisting of N integers is given. Rotation of the array means that each element is shifted right by one index, and the last element of the array is also moved to the first place. | |
For example, the rotation of array A = [3, 8, 9, 7, 6] is [6, 3, 8, 9, 7]. The goal is to rotate array A K times; that is, each element of A will be shifted to the right by K indexes. | |
Write a function: | |
class Solution { public int[] solution(int[] A, int K); } | |
that, given a zero-indexed array A consisting of N integers and an integer K, returns the array A rotated K times. | |
For example, given array A = [3, 8, 9, 7, 6] and K = 3, the function should return [9, 7, 6, 3, 8]. | |
Assume that: | |
N and K are integers within the range [0..100]; | |
each element of array A is an integer within the range [−1,000..1,000]. | |
In your solution, focus on correctness. The performance of your solution will not be the focus of the assessment. | |
Source: https://codility.com/programmers/task/cyclic_rotation/ | |
**/ | |
/** | |
* Created by mateus marquezini on 18-04-2016. | |
*/ | |
public class Solution { | |
public int[] solution(int[] A, int K) { | |
// otimizacao | |
// Verifica se o tamanho do array A é igual a zero e se K é igual ao tamanho do array A | |
if (A.length == 0 || K == A.length) { | |
return A; | |
} | |
while (K > 0) { | |
//1 - guarda ultima posicao | |
int aux = A[A.length - 1]; | |
//2 - faz shift de todos elementos, de traz para frente | |
for (int i = A.length - 1; i > 0; i--) { | |
A[i] = A[i - 1]; | |
} | |
//3 - atribui aux a primeira posicao | |
A[0] = aux; | |
K--; | |
} | |
return A; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment