283. Move Zeroes

标签：

Problem:

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.

One possible answer:

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int n = nums.size();
        int x = 0;
        for(int i=0;i<n;i++)
        {
            if(nums[i])
            {
                nums[x++]=nums[i];
            }
        }
        for(int i=x;i<n;i++)
        {
            nums[i] = 0;
        }
    }
};

283. Move Zeroes

标签：

原文地址：http://www.cnblogs.com/liutianyi10/p/5536524.html