44 leetcode - Rotate Array

最新推荐文章于 2025-08-08 00:00:33 发布

忧桑的小兔子

最新推荐文章于 2025-08-08 00:00:33 发布

阅读量234

点赞数

CC 4.0 BY-SA版权

文章标签： leetcode Python 算法旋转数组 rotate

本文链接：https://blog.youkuaiyun.com/lis_12/article/details/53725886

算法专栏收录该内容

84 篇文章

订阅专栏

本文介绍了一个Python实现的数组旋转算法，该算法通过三次反转操作完成数组的旋转，避免了额外的空间开销，实现了原地修改数组的功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#!/usr/bin/python
# -*- coding: utf-8 -*-
'''
Rotate Array
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].
'''
class Solution(object):
    def __rotate(self,nums,left,right):
        while left < right:
            tmp = nums[left]
            nums[left] = nums[right]
            nums[right] = tmp
            left += 1
            right -= 1

    def rotate(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: void Do not return anything, modify nums in-place instead.
        """
        length = len(nums)
        if 0 == length or 0 == k % length:
            return
        k = k % length
        self.__rotate(nums,0,length - k - 1)
        self.__rotate(nums,length - k,length - 1)
        self.__rotate(nums,0,length - 1)

if __name__ == "__main__":
    s = Solution()
    l = range(1,8)
    s.rotate(l,2)
    print l