Leetcode - Rotate Array
Problem
Rotate Array
Given an array, rotate the array to the right by
与えられた配列は、
Example 1: Solution
JavaScript
Rotate Array
Given an array, rotate the array to the right by
k steps, where k is non-negative.与えられた配列は、
k階まで回転する.kは正数ですExample 1:
Input: nums = [1,2,3,4,5,6,7], 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]Input: nums = [-1,-100,3,99], 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 <= nums.length <= 10⁵ -2³¹ <= nums[i] <= 2³¹ - 1 0 <= k <= 10⁵ JavaScript
/**
* @param {number[]} nums
* @param {number} k
* @return {void} Do not return anything, modify nums in-place instead.
*/
var rotate = function(nums, k) {
const size = nums.length
const rest = k % size
const tempArr = nums.splice(size - rest ,rest)
nums.splice(0, 0, ...tempArr)
};Reference
この問題について(Leetcode - Rotate Array), 我々は、より多くの情報をここで見つけました https://velog.io/@wanderer-s/Leetcode-Rotate-Arrayテキストは自由に共有またはコピーできます。ただし、このドキュメントのURLは参考URLとして残しておいてください。
Collection and Share based on the CC Protocol