leetCode 283. Move Zeroes 数组

283. Move Zeroes

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:

1. You must do this in-place without making a copy of the array.

2. Minimize the total number of operations.

题目大意：

将数组中元素为0的元素放到数组的后面，但是数组中其他非0元素，保持原来的顺序。

代码如下：

class Solution {
public:
    void moveZeroes(vector& nums) {
        int step = 0;
        for(int i = 0 ; i < nums.size();i++)
        {
            if(nums[i] == 0)
            {
                step++;
            }
            else
            {
                nums[i - step] = nums[i];
                if(step != 0)
                    nums[i] = 0;
            }
        }
    }
};

2016-08-12 01:26:32