283 移动零

https://leetcode.cn/leetbook/read/top-interview-questions-easy/x2ba4i/

https://leetcode.cn/problems/move-zeroes/description/

cost: 6m3s

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

• 时间复杂度：O(n)
• 空间复杂度：O(1)