【Question】
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.
void moveZeroes(vector<int>& nums) {
int count=0;
vector<int>::iterator iter;
for(iter=nums.begin();iter!=nums.end();)
{
if(*iter==0)
{
iter=nums.erase(iter);
count++;
}
else
iter++;
}
for(int i=0;i<count;i++)
nums.push_back(0);
}
方法二:利用双指针,第一个指针指向出现零的位置,第二个指向后面非零的位置,作交换。
public class Solution {
public void moveZeroes(int[] nums) {
int i=0;
int j=0;
while(j<nums.length)
{
if(nums[j]!=0)
{
if(j!=i)
{
nums[i++] = nums[j];
nums[j] = 0;
}
else
{
++i;
}
}
++j;
}
}
}