목록리스트 슬라이싱 (1)

기억보다 기록을

[Programmers] 배열 회전시키기

def solution1(numbers, direction): if direction == 'right': return [numbers[-1]] + numbers[:-1] else: return numbers[1:] + [numbers[0]] return answer def solution2 (numbers,direction): if direction == 'right': numbers = deque(numbers) numbers.rotate(1) return list(numbers) else: numbers = deque(numbers) numbers.rotate(-1) return list(numbers) source: https://school.programmers.co.kr/learn/course..
Algorithm/Programmers 2023. 1. 15. 16:04
이전 Prev 1 Next 다음