【Leet Code】283. Move Zeroes

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文链接：https://blog.csdn.net/shiliang97/article/details/102091931

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.

Example:

Input: [0,1,0,3,12] Output: [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.

来源：力扣（LeetCode） 链接：https://leetcode-cn.com/problems/move-zeroes 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

不小心下标又一次越界了。。。

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int n = nums.size();
        int a=0,b=0;
        for(b=0;b<n;b++){
            while(b<(n-1)&nums[b]==0){
                b++;
            }
            nums[a++]=nums[b];
        }
        while(a<n){
            nums[a++]=0;
        }
    }
};