LeetCode - Refresh - Rotate Array

Note:

1. K might be very very large. So remember to module it with n.

2. two range reverse (0, k-1), (k, n-1).

 

class Solution {
public:
    void reverse(int nums[], int start, int end) {
        while (start < end) {
            [](int &a, int &b) {int t = a; a = b; b = t;}(nums[start++], nums[end--]);
        }
    }
    void rotate(int nums[], int n, int k) {
        k %= n;
        reverse(nums, 0, n-1);
        reverse(nums, 0, k-1);
        reverse(nums, k, n-1);
    }
};