LeetCode刷题笔记：旋转数组

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]

Example 2:

Input: [-1,-100,3,99] and 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]

Note:

Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
Could you do it in-place with O(1) extra space?

解题思路

看到这道题首先比较直观的思路就是每次将vector末尾的值插入到vector的最前方，但是这里要注意一个问题，就是k值，k的值是有可能大于输入的长度的，所以这里需要做一个取余的操作，降低插入的次数，vector的插入函数有如下几种方式：

iterator insert ( iterator position, const T& x );
    void insert ( iterator position, size_type n, const T& x );
template <class InputIterator>
    void insert ( iterator position, InputIterator first, InputIterator last ); 

Solution1

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        if(nums.size() < 2) return;
        int size = nums.size();
        int num = k % size;
        for (int i = 0; i < k; ++i) {
            nums.insert(nums.begin(), 1, nums[size - 1]);
            nums.pop_back();
        }
    }
};

提交完这个版本，发现自己的执行用时仅仅站胜了23.69%的提交记录，顿时头皮发麻，于是阅读了前面一些人的代码，发现了大多数人提交的代码中使用了STL中的reverse函数：

//思路是先把前n-k个数字翻转一下，再把后k个数字翻转一下，最后再把整个数组翻转一下：
class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        if (nums.empty() || (k %= nums.size()) == 0) return;
        int n = nums.size();
        reverse(nums.begin(), nums.begin() + n - k);
        reverse(nums.begin() + n - k, nums.end());
        reverse(nums.begin(), nums.end());
    }
};