Carousel Shift
Imagine a carousel: elements move to the right, and the ones that pass the edge appear again at the beginning. The function rotate_right receives a list nums and shifts it cyclically to the right by k positions, returning a new list. The value of k may be larger than the list length, so remember to account for full rotations.
Примеры
Ввод
([1, 2, 3, 4, 5], 2)Вывод
[4, 5, 1, 2, 3]Ввод
([1, 2, 3], 0)Вывод
[1, 2, 3]Ввод
([1, 2, 3], 3)Вывод
[1, 2, 3]Нужно реализовать
def rotate_right(nums: list[int], k: int) -> list[int]:
Теги
lists
Logáil isteach chun stair na n-aighneachtaí a fheiceáil
Logáil isteachLogáil isteach chun an Meantóir IS a úsáid
Logáil isteachTests12
Visible tests
Tástáil fholaithe 7
Tástáil fholaithe 8
Tástáil fholaithe 9
Tástáil fholaithe 10
Tástáil fholaithe 11
Tástáil fholaithe 12
They run when you press "Submit" — your whole solution is checked against them so you can't hard-code answers for the visible cases.
Focus radio
Paused · SomaFM · Fluid