프로그래머스 Lv.0 배열 회전시키기

 

<Solution>

class Solution {
    public int[] solution(int[] numbers, String direction) {
        int[] answer = new int [numbers.length];
        if(direction.equals("right")) {
            answer[0] = numbers[numbers.length-1];
            System.arraycopy(numbers, 0, answer, 1, numbers.length - 1);
        } else if (direction.equals("left")) {
            answer[answer.length-1] = numbers[0];
            System.arraycopy(numbers, 1, answer, 0, numbers.length - 1);
        }
        return answer;
    }
}