leetcode189

public class Solution {
    public void reverse(int[] nums, int start, int end)
        {
            while (start < end)
            {
                int temp = nums[start];
                nums[start] = nums[end];
                nums[end] = temp;
                start++;
                end--;
            }
        }

        public void Rotate(int[] nums, int k)
        {
            k %= nums.Length;
            reverse(nums, , nums.Length - );
            reverse(nums, , k - );
            reverse(nums, k, nums.Length - );
        }
}

https://leetcode.com/problems/rotate-array/#/description

补充一个python的实现：

 class Solution:
     def rotate(self, nums: List[int], k: int) -> None:
         """
         Do not return anything, modify nums in-place instead.
         """
         n = len(nums)
         part1 = nums[n-k:]
         part2 = nums[:n-k]
         nums.clear()
         nums.extend(part1)
         nums.extend(part2)