LeetCode-in-Net.github.io

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

public class Solution {
    public void MoveZeroes(int[] nums) {
        int firstZero = 0;
        for (int i = 0; i < nums.Length; i++) {
            if (nums[i] != 0) {
                Swap(firstZero, i, nums);
                firstZero++;
            }
        }
    }

    private void Swap(int index1, int index2, int[] numbers) {
        int val2 = numbers[index2];
        numbers[index2] = numbers[index1];
        numbers[index1] = val2;
    }
}