<p>Given an integer array <code>nums</code>, move all <code>0</code>&#39;s to the end of it while maintaining the relative order of the non-zero elements.</p>

<p><strong>Note</strong> that you must do this in-place without making a copy of the array.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> nums = [0,1,0,3,12]
<strong>Output:</strong> [1,3,12,0,0]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> nums = [0]
<strong>Output:</strong> [0]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>4</sup></code></li>
	<li><code>-2<sup>31</sup> &lt;= nums[i] &lt;= 2<sup>31</sup> - 1</code></li>
</ul>

<p>&nbsp;</p>
<strong>Follow up:</strong> Could you minimize the total number of operations done?
class Solution {
public:
    void moveZeroes(vector<int>& nums) {

        //brute approach TC=O(2N) sc=O(N) extra space
        int j,n=nums.size();
        vector<int> arr(n,0);
        j=0;
        for(int i=0;i<n;++i)
        {
            if(nums[i])
            {
                arr[j++]=nums[i];
            }
        }
        for(int i=0;i<n;++i)
        {
            
            nums[i]=arr[i];
        }
    }
};
22300