leetcode Rotate Array

注意边界条件

class Solution {
public:
    void reverse(int nums[], int front, int end) {
        int last = end - 1;
        
        while (front < last)
            swap(nums[front++], nums[last--]);
            
        return;
    }
    
    void rotate(int nums[], int n, int k) {
        if (k <= 0)
            return;
        k %= n;
            
        reverse(nums, 0, n);
        reverse(nums, 0, k);
        reverse(nums, k, n);
    }
};