<leetcode刷题-数组> 【双指针】旋转数组

输入: nums = [1,2,3,4,5,6,7], k = 3
输出: [5,6,7,1,2,3,4]

翻转前: nums = [1,2,3,4,5,6,7]
翻转后: nums = [7,6,5,4,3,2,1]

void reserve(int *nums, int l, int r, int k, int numsSize)
{
    int tmp;
    while (l < r) {
        tmp = nums[l];
        nums[l] = nums[r];
        nums[r] = tmp;
        l++;
        r--;
    }

}

void rotate(int* nums, int numsSize, int k)
{
    int left = 0;
    int right = numsSize - 3 + 1;
    int ret;
    if ((nums == NULL) || (numsSize < 1))
        return 0;
    k = k % numsSize;
    // 翻转整个数组
    reserve(nums, 0, numsSize - 1, k, numsSize);
    // 翻转前k个元素
    reserve(nums, 0, k - 1, k, numsSize);
    // 翻转剩余元素
    reserve(nums, k, numsSize - 1, k, numsSize);
}