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.

解法： 以后K位为第二部分，翻转前一部分，翻转后一部分，再整体翻转。

public class Solution {

    public void rotate(int[] nums, int k) {
        int n = nums.length;
         if( n<=0||k<=0) return;
        k = (int) k%n;
        
        // first part
        for(int i = 0; i< (n-k)/2 ; i++){
            swap(nums,i,n-k-1-i);       // 以前写的是 swap(nums[x],nums[y]) 此为值传递，应该为引用传递
        }
        
        // second part
        for(int j = n-k; j<k/2 +n-k; j++){
            swap(nums,j,n-1-j+n-k);
        }
        
        // integrate
        for(int t =0; t< n/2 ; t++){
            swap(nums,t,n-t-1);
        }
    }
        
    public void swap(int[] n, int x, int y){ 
        int tmp = n[x];
        n[x] = n[y];
        n[y] = tmp;
    }
}