1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
|
#!/bin/python3
import math
import os
import random
import re
import sys
from collections import deque
#
# Complete the 'rotateLeft' function below.
#
# The function is expected to return an INTEGER_ARRAY.
# The function accepts following parameters:
# 1. INTEGER d
# 2. INTEGER_ARRAY arr
#
def rotateLeft(d, arr):
arr=deque(arr)
for i in range (d):
arr.append(arr[0])
arr.popleft()
return list(arr)
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
first_multiple_input = input().rstrip().split()
n = int(first_multiple_input[0])
d = int(first_multiple_input[1])
arr = list(map(int, input().rstrip().split()))
result = rotateLeft(d, arr)
fptr.write(' '.join(map(str, result)))
fptr.write('\n')
fptr.close()
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
Hacker rank CamelCase (0) | 2021.10.28 |
---|---|
Hacker rank Sparse Arrays (0) | 2021.10.28 |
Hacker rank Arrays - DS (0) | 2021.10.26 |
Hacker rank Big Sorting (0) | 2021.10.26 |
백준 21185 Some Sum (0) | 2021.10.26 |
댓글