旋转数组

class Solution {
    public void rotate(int[] nums, int k) {
          int count=k%nums.length;
        int limit= nums.length-count;
        reverse(nums,0,limit-1);
            reverse(nums,limit,nums.length-1);
            reverse(nums,0,nums.length-1);
    }
    public  void reverse(int[] arr,int st,int end){
        while(st<end){
            int temp=arr[st];
            arr[st]=arr[end];
            arr[end]=temp;
            st++;
            end--;
        }
    }
}