LeetCode_35 Rotate Array

题目描述:

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

输入样例:

1
2
3
4
5
6
7
8
9
10
11
12
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]
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]

Code:

1
2
3
4
5
6
7
8
9
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)
for i in range(-k, 0):
nums.insert(k + i, nums.pop(i))