forked from ngiengkianyew/daily-coding-problem
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblem_126.py
More file actions
30 lines (21 loc) · 739 Bytes
/
problem_126.py
File metadata and controls
30 lines (21 loc) · 739 Bytes
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
# Solution 1
def rotate_list_once(arr):
first = arr[0]
for i in range(len(arr) - 1):
arr[i] = arr[i + 1]
arr[-1] = first
return arr
def rotate_list(arr, k):
for _ in range(k):
arr = rotate_list_once(arr)
return arr
# Solution 2
def rotate_list_alt(arr, k):
return arr[k:] + arr[:k]
# Tests
assert rotate_list([1, 2, 3, 4, 5, 6], 0) == [1, 2, 3, 4, 5, 6]
assert rotate_list_alt([1, 2, 3, 4, 5, 6], 0) == [1, 2, 3, 4, 5, 6]
assert rotate_list([1, 2, 3, 4, 5, 6], 2) == [3, 4, 5, 6, 1, 2]
assert rotate_list_alt([1, 2, 3, 4, 5, 6], 2) == [3, 4, 5, 6, 1, 2]
assert rotate_list([1, 2, 3, 4, 5, 6], 4) == [5, 6, 1, 2, 3, 4]
assert rotate_list_alt([1, 2, 3, 4, 5, 6], 4) == [5, 6, 1, 2, 3, 4]