15算法课程 189. Rotate Array

原创于 2017-11-16 11:50:01 发布 · 190 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法

本文介绍了一种将数组元素向右旋转k步的算法实现，并提供了一种利用C++ STL中的rotate函数来解决该问题的方法。

Rotate an array of n elements to the right by k steps.

For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].

Note:
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.

[show hint]

Related problem: Reverse Words in a String II

Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.

solution：

可以使用STL自带的rotate()函数

code:

class Solution {
public:
void rotate(vector<int>& nums, int k) {
    int len = nums.size();
    if (len > 1) {
        k %= len;
        std::rotate(nums.begin(), nums.end() - k, nums.end());
    }
}
};