题目描述:
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.
Note:
You must do this in-place without making a copy of the array.
Minimize the total number of operations.
Example:
Given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].
题目大意:给出一个数字数组,写一个函数把数组中的0移到后面,但保持其它元素的相对位置。
思路:维护两个指针1,2(索引),指针2从前向后移动,遇到非0的数字则交换指针1,2指向的数字,同时将指针1向前推一位。这个操作的意思就是遇到0指向的数字,指针1就停下,交换使0放到后面。
c++代码:
class Solution {
public:
void moveZeroes(vector<int>& nums) {
for (int index = 0, current = 0; current < nums.size(); current++)
{
if (nums[current] != 0)
swap(nums[index++], nums[current]);
}
}
};