189. Rotate Array

最新推荐文章于 2025-05-02 21:33:35 发布

mOBSENCE11

最新推荐文章于 2025-05-02 21:33:35 发布

阅读量236

点赞数

分类专栏： leetcode刷题记录文章标签： leetcode python 算法

本文链接：https://blog.youkuaiyun.com/mOBSENCE11/article/details/79665593

版权

leetcode刷题记录专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一种将数组元素向右旋转k步的算法实现，并提供了一种简洁高效的Python代码示例。该方法通过调整数组切片的方式，实现了原地修改数组的目标。

摘要生成于 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].

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.

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.
        """
        n = len(nums)
        k = k % n
        nums[:] = nums[n-k:] + nums[:n-k] //!!!!一定是nums[:],不是nums，我也不知道为啥