Problem Statement

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:

• 1 <= nums.length <= 104
• 231 <= nums[i] <= 231 - 1

Problem Link

Move Zeroes - LeetCode

Code

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        
        int n = nums.size();
        int start = -1;
        for(int i=0;i<n;i++)
        {
            if(nums[i]==0)
            {
                start = i;
                break;
            }
        }
        
        if(start==-1)
            return;
        
        for(int i=0;i<n;i++)
        {
            if(nums[i]&&start>i)
                continue;
            
            if(nums[i])
            {
                swap(nums[i],nums[start]);
                start++;
            }
        }
        
    }
};