[프로그래머스 코딩테스트] java Lv.0 배열 회전시키기

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];
            for(int i=0;i<numbers.length-1;i++)
            {
                answer[i+1]=numbers[i];
             }
        }
        else if(direction.equals("left"))
        {
            answer[numbers.length-1]=numbers[0];
            for(int i=0;i<numbers.length-1;i++)
            {
                answer[i]=numbers[i+1]; 
            }
        }
        return answer;
    }
}

 

 

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==numbers.length-1) answer[0]=numbers[numbers.length-1];
                else answer[i+1]=numbers[i];
             }
        }
        else if(direction.equals("left"))
        {
            for(int i=0;i<numbers.length-1;i++)
            {
                answer[i]=numbers[i+1];
                if(i==0) answer[numbers.length-1]=numbers[0];
                
            }
        }
        return answer;
    }
}