class Solution {
public int[] solution(int[] numbers, String direction) {
if( direction.length() == 5) {
int a = numbers[numbers.length-1];
for (int i = numbers.length-1; i >0; i--) {
numbers[i] = numbers[i-1];
}
numbers[0] = a;
} else {
int a = numbers[0];
for (int i = 0; i < numbers.length-1; i++) {
numbers[i] = numbers[i+1];
}
numbers[numbers.length-1] = a;
}
return numbers;
}
}
뭔가 복잡한가 싶기도 하고 ㅋ