189Rotate 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]

Related problem: Reverse Words in a String II

Credits:

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

第一种方法实现：先翻转整个数组，然后再翻转第一部分，第一部分有k个值。

public class Solution {
		  public void rotate(int[] nums, int k) {
		    k %= nums.length;
		    reverse(nums, 0, nums.length-1);  // reverse the whole array
		    reverse(nums, 0, k-1);  // reverse the first part
		    reverse(nums, k, nums.length-1);  // reverse the second part
		}


		public void reverse(int[] nums, int l, int r) {
		    while (l < r) {
		        int tmp = nums[l];
		        nums[l++] = nums[r];
		        nums[r--] = tmp;
		    }
		}
		}

我的方法：

<pre name="code" class="java">public void rotate(int[] nums, int k) 
	{
		k=k%nums.length;
        for(int i=0;i<k;i++)
        {
        	int temp=nums[nums.length-1];
        	for(int j=nums.length-1;j>0;j--)
        	{
        		nums[j]=nums[j-1];
        	}
        	nums[0]=temp;
        }
    }

第一中2方法更加巧妙一些，但是在leetcode上凡是基于两次循环的都超时。