通过切片实现数组的右旋转

def right_rotate(arr, k):
    n = len(arr)
    k = k % n  # 计算实际需要旋转的步数
    return arr[-k:] + arr[:-k]

# 示例
arr = [1, 2, 3, 4, 5]
k = 2
result = right_rotate(arr, k)
print(result)  # 输出: [4, 5, 1, 2, 3]

def right_rotate_inplace(arr, k):
    n = len(arr)
    k = k % n
    reverse(arr, 0, n - 1)
    reverse(arr, 0, k - 1)
    reverse(arr, k, n - 1)

def reverse(arr, start, end):
    while start < end:
        arr[start], arr[end] = arr[end], arr[start]
        start += 1
        end -= 1

# 示例
arr = [1, 2, 3, 4, 5]
k = 2
right_rotate_inplace(arr, k)
print(arr)  # 输出: [4, 5, 1, 2, 3]