You are 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,0,1,2,0,5]
Output: [1,2,5,0,0,0]Example 2:
Input: nums = [0,1,0]
Output: [1,0,0]Constraints:
1 <= nums.length <= 10,000-(2^31) <= nums[i] <= ((2^31)-1)
Follow up: Could you minimize the total number of operations done?