MOVE ZEROS IN AN ARRAY LEETCODE SOLUTION C++ |ARSH GOYAL DSA SHEET

DESCRIPTION:
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

Follow up: Could you minimize the total number of operations done?

1.NAIVE : PICK NON ZERO ELEMENT PLACE IN TEMP ARRAY ,REST 0'S
2.OPTIMAL: PICK ZERO INCREMENT ELSE SWAP ZERO ELEMNET WITH NON ZERO ELEMENT

SOLUTION C++:

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int n = nums.size();
        int i = 0, j = 0;
        while(j<n)
        {
            if(nums[j]==0) j++;//if u found zero ,increment
            else{
                swap(nums[i], nums[j]); //if u found non zero swap it with zero 
                i++;
                j++;
            }
        }
    }
};