LeetCode

来源:互联网 发布:福州广电网络客服 编辑:程序博客网 时间:2024/06/02 04:27

Q:
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].

A:

class Solution(object):    def rotate(self, nums, k):        """        :type nums: List[int]        :type k: int        :rtype: void Do not return anything, modify nums in-place instead.        """        k = k % len(nums)        nums[:] = nums[-k:] + nums[:-k]

参考 My solution by using Python by Maples7 & GavinCode

原创粉丝点击