题目:
给你一个数组,将数组中的元素向右轮转 k 个位置,其中 k 是非负数。
class Solution {public void rotate(int[] nums, int k) {// 将传入的数组深拷贝一份nums2[] = null;int length = nums.length;for(int i = 0;i < length;i++){nums2[i] = num[i];}for(int i = 0;i < length;i++){int t = (i + k) % length - 1;num[t] = nums[i];}}}
@param {number[]} nums@param {number} k@return {void} Do not return anything, modify nums in-place instead.var rotate = function(nums, k) {let nums2 = [...nums]nums.forEach((item,index) => {const i = (index + k) % (nums2.length);nums[i] = nums2[index]})};
