Rotate Array Algorithm
Share:
Given an integer array nums, rotate the array to the right by k steps, where k is non-negative.
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]
Text
const reverse = function(nums,start,end) {
const newEnd = start + ((end - start) / 2 )
for (let i = start ; i < newEnd; i++) {
const temp = nums[i]
nums[i] = nums[end - 1 - i + start]
nums[end - 1 - i + start] = temp
}
return nums
}
var rotate = function(nums, k) {
const newK = k%nums.length
nums = reverse(nums,0,nums.length)
nums = reverse(nums,0,newK)
nums = reverse(nums,newK,nums.length)
};