189. Rotate Array(指定位置旋转数组)

problems:

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

Example 1:

Input: [1,2,3,4,5,6,7] and 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]

tip:

vector中没有push_front()操作!!!

solutions:

1.有种找下标规律的感觉.使用了辅助数组.

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        vector<int> t=nums;
        for(int i = 0;i < nums.size();i++)
        {
            nums[(i+k)%nums.size()] = t[i];
        }
    }
};

2.类似字符的逆序处理,很神奇的感觉.

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int n =nums.size();
        if(n == 0 || (k%=n)==0) return;//这里要注意,是进行k次移动
        if(nums.empty() ) return;
        reverse(nums.begin(),nums.begin()+n-k);
        reverse(nums.begin()+n-k,nums.end());
        reverse(nums.begin(),nums.end());
    }
};

3.把前(n-k)个元素移动至末尾处.

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        if (nums.empty() || (k %= nums.size()) == 0) return;
        int n = nums.size();
        for (int i = 0; i < n - k; ++i) {
            nums.push_back(nums[0]);
            nums.erase(nums.begin());
        }
    }
};