LeetCode OJ Rotate Array

数组旋转算法

Nightonke

于 2015-03-24 09:19:55 发布

阅读量554

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/u012925008/article/details/44587247

leetcode 专栏收录该内容

219 篇文章

订阅专栏

本文介绍了一种将数组元素向右旋转k步的算法实现，并提供了一段C++代码示例。该算法通过循环重新定位每个元素的位置来完成旋转操作。

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.

class Solution {
public:
	void rotate(int nums[], int n, int k) {
		if (n == 0 || k % n == 0) return;
		int p = 0, last = nums[0], startp = 0, q, temp;
		for (int i = 0; i < n; i++) {
			q = (p + k) % n;
			if (q == startp) {
				nums[startp] = last;
				last = nums[++startp];
				p = startp;
				continue;
			}
			temp = nums[q];
			nums[q] = last;
			last = temp;
			p = q;
		}
	}
};