目錄題目示例 1:示例 2:答案解法1：解法2：解法3：解法4：題目

給定一個(gè)數(shù)組，將數(shù)組中的元素向右移動(dòng) k 個(gè)位置，其中 k 是非負(fù)數(shù)。

示例 1:

輸入: [1,2,3,4,5,6,7] 和 k = 3 輸出: [5,6,7,1,2,3,4]

解釋:

向右旋轉(zhuǎn) 1 步: [7,1,2,3,4,5,6]

向右旋轉(zhuǎn) 2 步: [6,7,1,2,3,4,5]

向右旋轉(zhuǎn) 3 步: [5,6,7,1,2,3,4]

示例 2:

輸入: [-1,-100,3,99] 和 k = 2 輸出: [3,99,-1,-100]

解釋:

向右旋轉(zhuǎn) 1 步: [99,-1,-100,3]

向右旋轉(zhuǎn) 2 步: [3,99,-1,-100]

答案解法1：const rotate = (nums, k) => { for(var i = 0; i<k; i++){nums.unshift(nums.pop()); } return nums;}解法2：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};解法3：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;}解法4：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 }

以上就是JS算法題解旋轉(zhuǎn)數(shù)組方法示例的詳細(xì)內(nèi)容，更多關(guān)于JS算法題解旋轉(zhuǎn)數(shù)組的資料請(qǐng)關(guān)注好吧啦網(wǎng)其它相關(guān)文章！