Leetcode-283. Move Zeroes

283. Move Zeroes

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.

For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].

Note:
You must do this in-place without making a copy of the array.
Minimize the total number of operations.

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
             int swap;
             if(nums.size()>1)
             {
             for(int i=nums.size()-2;i>=0;i--)
               {
                   while(nums[i]==0&&nums[i+1]!=0)
                   {
                        int j=i;
                        while(nums[j+1]!=0&&j<nums.size()-1)
                        {
                         swap=nums[j];
                         nums[j]=nums[j+1];
                         nums[j+1]=swap;
                         j++;
                        }

                   }
              }

             }
         }
};