Leetcode - Rotate Array

·2022년 1월 30일
0

목록 보기
14/19

Problem

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]

Example 2:

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]

Constraints:

• 1 <= nums.length <= 10⁵
• -2³¹ <= nums[i] <= 2³¹ - 1
• 0 <= k <= 10⁵

Solution

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)
};

Feedback은 언제나 환영입니다🤗

You only get one life. It's actually your duty to live it as fully as possible.