【LeetCode】283.移动零

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        if(nums.empty()) return;
        int l=0;
        int r=0;
        int len=nums.size();
        while(l<len&&r<len){
            if(l==len-1) break;
            r=max(r,l);
            if(nums[l]==0){
                while(r<len&&nums[r]==0) r++;
                if(r==len) break;
                swap(nums[l],nums[r]);
            }
            l++;
        }
        return;
    }
};