leetcode283 - Move Zeroes - easy

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:

1. You must do this in-place without making a copy of the array.
2. Minimize the total number of operations.

 

同向双指针。i loop 整个input，j用来表示output的index，i找到非0数的时候，就写进j。

i遍历结束后，从j的位置往后就全是0了

 

实现：

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        
        int i = 0, j = 0;
        while (i < nums.size()){
            if (nums[i] != 0){
                nums[j++] = nums[i];
            }
            i++;
        }
        
        while (j < nums.size()){
            nums[j++] = 0;
        }
        
    }
};