283. Move Zeroes

https://leetcode.com/problems/move-zeroes/

Problem

Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.

Example:

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

Note:

1. You must do this in-place without making a copy of the array.

2. Minimize the total number of operations.

Solution

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int non_zero_idx = 0;
        for (int i = 0; i < nums.size(); ++i) {
            if (nums[i] != 0) {
                int temp = nums[i];
                nums[i] = nums[non_zero_idx];
                nums[non_zero_idx++] = temp;
            }
        }
    }
};

• #twopointer