Leetcode 283. 移动零（DAY 83） ----Leetcode Hot 100

---

原题题目

---

---

代码实现（首刷自解）

---

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int count = 0;
        auto pos = nums.begin();
        while(pos != nums.end())
        {
            if(!(*pos))
            {
                pos = nums.erase(pos);
                ++count;
            }
            else  ++pos;
        }
        for(int i=1;i<=count;++i)   nums.push_back(0);
    }
};

---

代码实现（二刷DAY 137自解）

---

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

---

代码实现（三刷自解 DAY 262 C++）

---

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

        return;
    }
};

---

代码实现（四刷自解 DAY 299 C++）

---

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

---

代码实现（五刷自解 DAY 10 Golang）

---

func moveZeroes(nums []int)  {
  for pos, i := 0, 0; i < len(nums); i++ {
    if nums[i] == 0 {
      continue
    }
    nums[pos], nums[i] = nums[i], nums[pos]
    pos++
  }
}