LeetCode-189. Rotate Array

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]

Hint:
Could you do it in-place with O(1) extra space?

Related problem: Reverse Words in a String II

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

就是一个数组翻转的 过程  通过  arrayCopy方法很方便解决

class Solution {
    public void rotate(int[] nums, int k) {
         int n = nums.length;
	        k = k%n;
	        int[] temp = Arrays.copyOfRange(nums, 0, n-k);
	        System.arraycopy(nums, n-k, nums, 0, k);
	        System.arraycopy(temp, 0, nums, k, n-k);
			 
    }
}

 

System提供了一个静态方法arraycopy(),我们可以使用它来实现数组之间的复制。其函数原型是：

public static void (Object src,  int srcPos,  Object dest,  int destPos,   int length)

src:源数组；    srcPos:源数组要复制的起始位置；

dest:目的数组；    destPos:目的数组放置的起始位置；    length:复制的长度。

注意：src and dest都必须是同类型或者可以进行转换类型的数组．

有趣的是这个函数可以实现自己到自己复制，比如：

int[] fun ={0,1,2,3,4,5,6};

System.arraycopy(fun,0,fun,3,3);

则结果为：{0,1,2,0,1,2,6};

实现过程是这样的，先生成一个长度为length的临时数组,将fun数组中srcPos

到srcPos+length-1之间的数据拷贝到临时数组中，再执行System.arraycopy(临时数组,0,fun,3,3).