## Move Zeroes

07/17/2016 Array Two Pointers

## Question

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.

For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [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.

## Solution

Result: Accepted Time: 8 ms

Here should be some explanations.

void moveZeroes(int* nums, int numsSize) {
int cnt = 0;
for(int i = 0; i < numsSize; i++)
if(nums[i])
nums[cnt++] = nums[i];
while(cnt < numsSize)
nums[cnt++] = 0;
}


Complexity Analytics

• Time Complexity: $O(n)$
• Space Complexity: $O(1)$