소스코드
if(A.length==0){
return A;
}
List<Integer> AList = new ArrayList<Integer>();
for(int i = 0 ; i < A.length ; i++){
AList.add(A[i]);
}
while(K > 0){
Integer temp = AList.get(AList.size()-1);
AList.remove(AList.size()-1);
AList.add(0, temp);
K--;
}
for(int i = 0 ; i < AList.size() ; i++){
A[i] = AList.get(i);
}
return A;
'공부-codility' 카테고리의 다른 글
[Lesson] 3. TapeEquilibrium (0) | 2022.08.04 |
---|---|
[Lesson] 3. PermMissionElem (0) | 2022.08.04 |
[Lesson] 3. FrogJmp (0) | 2022.08.04 |
[Lesson] 2. Arrays - OddOccurrencesInArray (0) | 2022.08.04 |
[Lesson] 1. Iterations (0) | 2022.08.04 |