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
Melde dich an, um den Einreichungsverlauf zu sehen
AnmeldenMelde dich an, um den KI-Mentor zu nutzen
AnmeldenTests12
Visible tests
Versteckter Test 7
Versteckter Test 8
Versteckter Test 9
Versteckter Test 10
Versteckter Test 11
Versteckter Test 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