LeetCode-in-All

283. Move Zeroes

Easy

Given an integer array nums, move all 0’s to the end of it while maintaining the relative order of the non-zero elements.

Note that you must do this in-place without making a copy of the array.

Example 1:

Input: nums = [0,1,0,3,12]

Output: [1,3,12,0,0]

Example 2:

Input: nums = [0]

Output: [0]

Constraints:

Follow up: Could you minimize the total number of operations done?

Solution

object Solution {
    def moveZeroes(nums: Array[Int]): Unit = {
        var firstZero = 0
        for (i <- nums.indices) {
            if (nums(i) != 0) {
                swap(firstZero, i, nums)
                firstZero += 1
            }
        }
    }

    private def swap(index1: Int, index2: Int, numbers: Array[Int]): Unit = {
        val val2 = numbers(index2)
        numbers(index2) = numbers(index1)
        numbers(index1) = val2
    }
}