Move Zeroes
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.
Follow up: Could you minimize the total number of operations done?
Example 1
Input
nums = [0,1,0,3,12]Output
[1,3,12,0,0]All non-zero elements keep their relative order, and the zeroes are moved to the end.
Example 2
Input
nums = [0]Output
[0]The array contains only one zero, so it remains unchanged.
Constraints
- 1 <= nums.length <= 10^4
- -2^31 <= nums[i] <= 2^31 - 1