题目翻译*

 Rotate Array - LeetCode

Rotate Array

Given an array, rotate the array to the right by k steps, where k is non-negative.

Example 1:

Input: nums = [1,2,3,4,5,6,7], k = 3

Output: [5,6,7,1,2,3,4]

Explanation:

rotate 1 steps to the right: [7,1,2,3,4,5,6]

rotate 2 steps to the right: [6,7,1,2,3,4,5]

rotate 3 steps to the right: [5,6,7,1,2,3,4]

Example 2:

Input: nums = [-1,-100,3,99], k = 2

Output: [3,99,-1,-100]

Explanation:

rotate 1 steps to the right: [99,-1,-100,3]

rotate 2 steps to the right: [3,99,-1,-100]

旋转数组

给你一个数组，将数组向右旋转k位，其中k为非负值。

例子1

输入: nums = [1,2,3,4,5,6,7], k = 3

输出: [5,6,7,1,2,3,4]

解释

向右旋转1位: [7,1,2,3,4,5,6]

向右旋转2位: [6,7,1,2,3,4,5]

向右旋转3位: [5,6,7,1,2,3,4]

例子2

输入: nums = [-1,-100,3,99], k = 2

输出: [3,99,-1,-100]

解释:

向右旋转1位: [99,-1,-100,3]

向右旋转2位: [3,99,-1,-100]

限制

1 <= nums.length <= 10e5

-2e31 <= nums[i] <= 2e31 - 1

0 <= k <= 10e5