leetcode 189

import java.util.*;
class Solution_TimeLimit {
    public void rotate(int[] nums, int k) {
		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;
		}
    }
}

class Solution{
	public void rotate(int[] nums, int k) {
		if(nums.length<0)
			return;
		int n=nums.length;
		k=k%n;
		int[] temp=new int[k];
		System.arraycopy(nums,n-k,temp,0,k);//将5,6,7复制到临时数组temp中
		System.arraycopy(nums,0,nums,k,n-k);//将1,2,3,4复制到数组nums后四位上
		System.arraycopy(temp,0,nums,0,k);//将5,6,7再复制到数组nums的前三位上
	
	}

}

class Test189 
{
	public static void main(String[] args) 
	{
		int[] nums={1,2,3,4,5,6,7};
		Solution s=new Solution();
		s.rotate(nums,3);
		System.out.println(Arrays.toString(nums));
	}
}