给定一个数组,将数组向右边翻转 k 步

in Algorithm with 0 comment

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

Example 1:

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]

Example 2:

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]

Programmer

var rotate = function(nums, k) {
    let x =0
    
    while(x < k) {
        // 删除最后一个元素并返回
        let c = nums.pop();
        // 将这个元素添加到数组开头
        nums.unshift(c)
        x++
    }
};

Tips

将每次删除的元素放置在数组头部,直到放置了第 k 个元素,也就是第 k 步