283. Move Zeroes

題目原文

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.

解題思路

1. 將不是等於0的值往前搬移。

2. 計算補多少0。

程式解答

還沒想到更漂亮的解法

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