leetcode Rotate Array

题目链接点击打开链接

public class Solution {

	public void rotate(int[] nums, int k) {
                k%=nums.length;
                rev(nums,0,nums.length-1-k);
		rev(nums,nums.length-k,nums.length-1);
		rev(nums,0,nums.length-1);
		

	}


	public static void rev(int []arr,int l,int r)    
	{    
		int temp;    

		int right=r;    
		for(int  left=l;left<right;left++)    
		{    
			temp=arr[left];    
			arr[left]=arr[right];    
			arr[right]=temp;    
			right--;    
		}    
	}  
}