189.轮转数组
题目
LeetCode 中等
INFO
给定一个整数数组 nums,将数组中的元素向右轮转 k 个位置,其中 k 是非负数。
示例:
输入:nums = [-1,-100,3,99], k = 2
输出:[3,99,-1,-100]
解释:
向右轮转 1 步: [99,-1,-100,3]
向右轮转 2 步: [3,99,-1,-100]
输入: nums = [1,2,3,4,5,6,7], k = 3
输出: [5,6,7,1,2,3,4]
解释:
向右轮转 1 步: [7,1,2,3,4,5,6]
向右轮转 2 步: [6,7,1,2,3,4,5]
向右轮转 3 步: [5,6,7,1,2,3,4]
题解
方法:新数组
O(n) O(n)
ts
function rotate(nums: number[], k: number): void {
let len = nums.length
let newArr = new Array(len)
for (let i = 0; i < len; i++) {
newArr[(i + k) % len] = nums[i]
}
for (let i = 0; i < len; ++i) {
nums[i] = newArr[i]
}
}
const nums = [-1, -100, 3, 99],
k = 2
rotate(nums, k)
console.log('🌰', nums)
方法:原地
O(n) O(1)
ts
function rotate2(nums: number[], k: number): void {
const len = nums.length
k %= len
const reverse = (nums: number[], start: number, end: number) => {
while (start < end) {
;[nums[start], nums[end]] = [nums[end], nums[start]]
start += 1
end -= 1
}
}
reverse(nums, 0, len - 1) //翻转所有元素
console.log('翻转所有元素后:', nums)
reverse(nums, 0, k - 1) //翻转 [0,k-1] 区间的元素
console.log('翻转 [0,k-1] 区间:', nums)
reverse(nums, k, len - 1) //翻转 [k,n-1] 区间的元素
console.log('翻转 [k,n-1] 区间:', nums)
}
const nums2 = [1, 2, 3, 4, 5, 6, 7],
k2 = 10
rotate2(nums2, k2)
console.log('🌰', nums2)