LeetCode189. Rotate Array

船桥

于 2018-09-17 09:04:33 发布

阅读量123

点赞数

CC 4.0 BY-SA版权

分类专栏： Python LeetCode

本文链接：https://blog.youkuaiyun.com/AIpush/article/details/82732139

LeetCode 同时被 2 个专栏收录

179 篇文章

订阅专栏

Python

173 篇文章

订阅专栏

本文介绍了一个数组旋转问题的解决方案，即如何将数组中的元素向右移动k步，并提供了Python实现方法。通过示例展示了不同输入下数组的变化过程，强调了在实际操作中需要注意的细节。

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

Given an array, rotate the array to the right by k steps, where k is non-negative.

Example 1:

Input: 
[1,2,3,4,5,6,7]
 and k = 3
Output: 
[5,6,7,1,2,3,4]

Explanation:
rotate 1 steps to the right: 
[7,1,2,3,4,5,6]

rotate 2 steps to the right: 
[6,7,1,2,3,4,5]
rotate 3 steps to the right: 
[5,6,7,1,2,3,4]

Example 2:

Input: 
[-1,-100,3,99]
 and k = 2
Output: [3,99,-1,-100]
Explanation: 
rotate 1 steps to the right: [99,-1,-100,3]
rotate 2 steps to the right: [3,99,-1,-100]

Note:

Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
Could you do it in-place with O(1) extra space?

<思路>这个题直接用python的list切片就行。注意先要对list长度取余，防止循环次数大于list长度。

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]