Skip to main content

Rotate Array

Problem Statement​

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

LeetCode link

Example 1​

Input: nums = [1,2,3,4,5,6,7], 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: nums = [-1,-100,3,99], 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]

Constraints:​

  • 1 <= nums.length <= 105
  • -231 <= nums[i] <= 231 - 1
  • 0 <= k <= 105

Code​

Python Code
class Solution:
    def rotate(self, nums, k):
        nums[:] = nums[-(k%len(nums)):] + nums[:-k%len(nums)]