leetcode 189. Rotate Array

最新推荐文章于 2025-12-28 17:52:30 发布

原创最新推荐文章于 2025-12-28 17:52:30 发布 · 469 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

数据结构与算法同时被 2 个专栏收录

213 篇文章

订阅专栏

196 篇文章

订阅专栏

本文介绍了如何将数组中的元素向右移动指定步数，并提供了三种不同的解决方案。使用类Solution来实现旋转操作，确保数组大小考虑特殊情况并进行模运算以避免无效操作。

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.

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