[leetcode]Rotate Array

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.

解题思路：整体翻转后，部分再翻转

public class Solution {
    private void swapArrayInPiece(int[] a, int s, int e){
        while(s < e){
            a[s] ^= a[e];
            a[e] ^= a[s];
            a[s] ^= a[e];
            s++;
            e--;
        }    
    }
    public void rotate(int[] nums, int k) {
        int i = 0;
        int j = nums.length - 1;
        
        k = k % nums.length;
        if(k == 0) return;
        swapArrayInPiece(nums, i, j);
        swapArrayInPiece(nums, i, k - 1);
        swapArrayInPiece(nums, k, j);
    }
}