g0201_0300.s0283_move_zeroes.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

// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Two_Pointers
// #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays
// #Big_O_Time_O(n)_Space_O(1) #2023_10_06_Time_71_ms_(91.63%)_Space_47.2_MB_(57.52%)

/*
 Do not return anything, modify nums in-place instead.
 */
function moveZeroes(nums: number[]): void {
    let firstZero = 0
    for (let i = 0; i < nums.length; i++) {
        if (nums[i] !== 0) {
            const temp = nums[i]
            nums[i] = nums[firstZero]
            nums[firstZero] = temp
            firstZero++
        }
    }
}

export { moveZeroes }