LeetCode 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:

  • You must do this in-place without making a copy of the array.
  • Minimize the total number of operations.
class Solution {// 水题
public:
    void moveZeroes(vector<int>& nums) {
         int cnt=0;
         for(int i=0;i<nums.size();i++)
             if(nums[i]==0){
                 cnt++;
                 nums.erase(nums.begin()+i);
                 i--;
             }
         for(int i=0;i<cnt;i++)
             nums.push_back(0);
    }
};
posted @ 2018-12-03 15:21  A-Little-Nut  阅读(119)  评论(0编辑  收藏  举报