Leetcode skimming ---283

subject ： Given an array nums, Write a function that will 0 Move to end of array , While maintaining the relative order of non-zero elements . Please note that , You must operate on the array in place without copying it .

Input ：nums = [0,1,0,3,12]

Output ：[1, 3, 12, 0, 0]

Method 1 ： Double pointer

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

Complexity analysis

Time complexity ：O(n)

Spatial complexity ：O(1)