| English | 简体中文 |
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.
Input: nums = [0,1,0,3,12] Output: [1,3,12,0,0]
Input: nums =  Output: 
1 <= nums.length <= 104
-231 <= nums[i] <= 231 - 1
Follow up: Could you minimize the total number of operations done?