leetcode 189. 旋转数组

最新推荐文章于 2024-10-01 05:04:32 发布

萝卜upupup

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量43

点赞数

文章标签： leetcode 算法 python

本文链接：https://blog.csdn.net/weixin_43973433/article/details/110386617

版权

leetcode 189. 旋转数组

https://leetcode-cn.com/problems/rotate-array/

class Solution(object):
    def rotate(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: None Do not return anything, modify nums in-place instead.
        """
        n=len(nums)
        if n<=1:
            return nums
        
        k=k%n
        start_index=0
        change_num=0 #总共需要改变n个数共n次位置

        while change_num<n:
            next_pos=(start_index+k)%n
            tmp=nums[start_index]
            while next_pos!=start_index:
                tmp,nums[next_pos]=nums[next_pos],tmp
                change_num+=1
                next_pos=(next_pos+k)%n
            nums[next_pos]=tmp
            change_num+=1
            start_index+=1
        return nums