题解 | #移动 0#

#include <vector>
class Solution {
public:

    vector<int> moveZeroes(vector<int>& nums) {
        // write code here
        int k = 0;
        int p = 0; //工作指针
        int n = nums.size();
        int count = 0;
      for(; p < n; p++){
        if(nums[p] != 0){
            nums[k] = nums[p];
            k++;
        }
        else {
           count++;
        }
      }
      int i = 0;
      while(count){
        nums[n - 1 - i] = 0;
        i ++;
        count--;
      }
      return nums;
    }
};