[Programmers] 배열 회전시키기

https://school.programmers.co.kr/learn/courses/30/lessons/120844

프로그래머스

 

 

def solution(numbers, direction):
    answer = []
    
    if direction == 'right' :
        answer.append(numbers[len(numbers)-1])
        for i in range(len(numbers)-1) :
            answer.append(numbers[i])
    else :
        for i in range(len(numbers)) :
            try : answer.append(numbers[i+1])
            except: answer.append(numbers[0])

    return answer

 

 

 

from collections import deque

def solution(numbers, direction) :
	numbers = deque(numbers)
    if direction == "right" :
    	numbers.rotate(1)
    elif direction == "left" :
    	numbers.rotate(-1)
    
    return list(numbers)

def solution(numbers, direction) :
	answer = 0
    if direction == "right" :
    	answer = [numbers[-1]] + numbers[:len(numbers)-1]
    else :
    	answer = numbers[1:] + [numbers[0]]
    return answer

def solution(numbers, direction) :
	answer = []
    
    if direction == 'right' :
    	answer.append(numbers[-1]
        
        for i in numbers[0:-] :
        	answer.append(i)
        
    else :
    	for i in numbers[1:] :
        	answer.append(i)
        
        answer.append(numbers[0])
    return answer