Eric 的小站

1
输入: nums = [1,2,3,4,5,6,7], k = 3
2
输出: [5,6,7,1,2,3,4]
3
解释:
4
向右轮转 1 步: [7,1,2,3,4,5,6]
5
向右轮转 2 步: [6,7,1,2,3,4,5]
6
向右轮转 3 步: [5,6,7,1,2,3,4]

1
输入：nums = [-1,-100,3,99], k = 2
2
输出：[3,99,-1,-100]
3
解释:
4
向右轮转 1 步: [99,-1,-100,3]
5
向右轮转 2 步: [3,99,-1,-100]

1
class Solution {
2
public:
3
    void rotate(vector<int>& nums, int k) {
4
        int move = k % nums.size();
5
        int index = 0;
6
        vector<int> Temp(nums.size());
7
        for (int i = move; i < nums.size(); i++) {
8
            Temp[i] = nums[index++];
9
        }
10
        for (int i = 0; i < move; i++) {
11
            Temp[i] = nums[index++];
12
        }
13
        for (int i = 0; i < nums.size(); i++) {
14
            nums[i] = Temp[i];
15
        }
16
    }
17
};