题目描述
- Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.
For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].
- Note:
- You must do this in-place without making a copy of the array.
- Minimize the total number of operations.
代码实现
class Solution{public: void moveZeroes(vector<int>& nums){int n = nums.size();int i, j;i = j = 0;while(i < n){if(nums[i] != 0){nums[j++] = nums[i];}i++; }while(j < n){nums[j++] = 0; } }};