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.
我的解法和想法:
把一个数组中所有非0的数依次往前移,那么剩下的用0填充即可:
class Solution {
public:
void moveZeroes(vector<int>& nums) {
//vector<int>::iterator it;
//for(it=vec.begin)
int size = nums.size();
int count = 0;
for(int i=0; i<size; i++)
{
if(nums[i] != 0)
{
nums[count++] = nums[i];
}
}
for(int i= count; i<size; i++)
{
nums[i] = 0;
}
}
};