Leetcode: Rotate Array

最新推荐文章于 2020-06-22 08:05:11 发布

原创最新推荐文章于 2020-06-22 08:05:11 发布 · 273 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

216 篇文章

订阅专栏

本文详细解释了如何通过代码实现数组向右旋转指定步数的操作，包括三种不同的解决方案，并提供了关键步骤的说明。

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

Question

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

Note:
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.

[show hint]

Related problem: Reverse Words in a String II

Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.

Show Tags
Show Similar Problems

Solution

Get idea from here。

class Solution:
    # @param {integer[]} nums
    # @param {integer} k
    # @return {void} Do not return anything, modify nums in-place instead.
    def rotate(self, nums, k):
        k = k % len(nums)
        self.reversea(nums, 0, len(nums)-1)
        self.reversea(nums, 0, k-1)
        self.reversea(nums, k, len(nums)-1)

    def reversea(self, nums, start, end):
        while start<end:
            temp = nums[start]
            nums[start] = nums[end]
            nums[end] = temp
            start += 1
            end -= 1