Leetcode 283. Move Zeroes

283. Move Zeroes

• Total Accepted: 98144
• Total Submissions: 216474
• Difficulty: Easy

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].

思路：遇到等于0的数，直接替换或者删除。

代码：

写法一：16 ms

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

写法二：20 ms

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

写法三：28 ms

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int i,size=nums.size();
        for(i=0;i<nums.size();){
            if(nums[i]==0) nums.erase(nums.begin()+i);
            else{
                i++;
            }
        }
        for(;i<size;i++){
            nums.push_back(0);
        }
    }
};