283. Move Zeroes

• Difficulty: Easy

• Topics: Array, Two Pointers

• Similar Questions:

  • Remove Element

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.

Solutions:

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