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.
思路:
设置两个指针,将当前数组看做两个数组,index指向当前插入数组位置的最后元素,i指向当前要处理的元素。将非零元素插入index指向的下一个位置。在一遍遍历完数组后,将index后面的元素全部设置为零即可。
代码实现:
class Solution {
public:
void moveZeroes(vector<int>& nums) {
int index = -1;
for(int i = 0; i < nums.size(); ++i)
{
if(nums[i] != 0)
{
nums[++index] = nums[i];
}
}
for(int i = index+1; i < nums.size(); ++i)
nums[i] = 0;
return;
}
};