题目

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

将一个数组向右旋转K步,k为非负数

• 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]

• 解法1，leetcode测试不通过，但是自己本地测试通过，不知为什么...

var rotate = function(nums, k) {
  return nums.splice(-k).concat(nums)
};

• 解法2，完全通过

var rotate = function(nums,k){
  for(let i = 0; i < k; i++){
    nums.unshift(nums.pop())
  }
  return nums
}