[leetcode]Rotate Array(using Python)

原创于 2017-03-16 15:27:08 发布 · 541 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#python #leetcode

本文介绍了一种将数组元素向右旋转k步的算法实现。通过示例演示了如何将长度为7的数组[1,2,3,4,5,6,7]旋转成[5,6,7,1,2,3,4]的过程。

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

原题连接：点击打开链接

题目：

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, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: void Do not return anything, modify nums in-place instead.
        """
        if k>0 and k<len(nums):
            l_get = nums[len(nums)-k:len(nums)]
            l_front = nums[0:len(nums)-k]
            for i in range(0,len(l_front)):
                l_get.append(l_front[i])
            for j in range(0,len(nums)):
                nums[j] = l_get[j]
        elif k > len(nums):
            k = k % len(nums)
            l_get = nums[len(nums)-k:len(nums)]
            l_front = nums[0:len(nums)-k]
            for i in range(0,len(l_front)):
                l_get.append(l_front[i])
            for j in range(0,len(nums)):
                nums[j] = l_get[j]
        else:
            pass