JavaScript实现数组向右旋转k步的多种算法解析

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

const rotate = (nums, k) => {
    const n = nums.length;
    let tmpEnd = 0;
    let tmpPrev = 0;
    for(let i = 0; i<k; i++) {
        tmpEnd = nums[n-1];
        for(let r = 0; r<n; r++) {
            tmpPrev = nums[r];
            nums[r] = tmpEnd;
            tmpEnd = tmpPrev;
        }
    }
    return nums
};

const rotate = (nums, k) => {
    const n = nums.length;
    let reversePoint = n - k%n;
    reversePoint != 0 && (nums = nums.slice(reversePoint).concat(nums.slice(0, reversePoint)));
    return nums;
}

const rotate = (nums, k) => {
    const n = nums.length;
    let newArr = new Array(n);
    for(let i = 0;i<n; i++){
        newArr[(i+k)%n] = nums[i];
    }    
    for(let r = 0; r<n; r++){
        nums[r] = newArr[r];
    }  
    return nums  
}