本文共 564 字，大约阅读时间需要 1 分钟。
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].
旋转数组k次，即将数组中位于最后的数字不断挪到第一个位置；
self.nums = nums[-k:] + nums[:-k]
for i in range(len(self.nums)):
self.reverse(nums, 0, n - 1)
self.reverse(nums, 0, k - 1)
self.reverse(nums, k, n - 1)
def reverse(self, nums, start, end):
转载地址：http://lmbvb.baihongyu.com/