[JAVA 문제 풀이] 31. 배열 회전시키기

class Solution {
    public int[] solution(int[] numbers, String direction) {
        int[] answer = new int[numbers.length];
        if(direction.equals("right")) {
            for (int i = 0; i < numbers.length; i++) {
                if (i == 0) {
                    answer[i] = numbers[numbers.length - 1];
                } else {
                    answer[i] = numbers[i - 1];
                }
            }
            return answer;
        }
        for (int i = numbers.length - 1; i >= 0; i--) {
            if (i == numbers.length - 1) {
                answer[i] = numbers[0];
            } else {
                answer[i] = numbers[i + 1];
            }
        }
        return answer;
    }
}