g0101_0200.s0189_rotate_array.solution.ts Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Two_Pointers
// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
// #2023_10_09_Time_75_ms_(97.25%)_Space_52_MB_(63.34%)

/*
 Do not return anything, modify nums in-place instead.
 */
function reverse(nums: number[], l: number, r: number): void {
    while (l <= r) {
        const temp = nums[l]
        nums[l] = nums[r]
        nums[r] = temp
        l++
        r--
    }
}

function rotate(nums: number[], k: number): void {
    const n = nums.length
    const t = n - (k % n)
    reverse(nums, 0, t - 1)
    reverse(nums, t, n - 1)
    reverse(nums, 0, n - 1)
}

export { rotate }