# Leetcode: Move Zeroes

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.

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.

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.

```## Blog link: https://code.dennyzhang.com/move-zeroes
class Solution(object):
def moveZeroes(self, nums):
"""
:type nums: List[int]
:rtype: void Do not return anything, modify nums in-place instead.
"""
## Idea: 2 pointers
## Complexity: Time O(n), Space O(1)
## 1, 2, 0, 3, 12
## i points to place whose value is 0
## j starts from i+1, point to the place of first non-Zero value
length = len(nums)
j = 0
for i in range(0, length-1):
if nums[i] == 0:
for j in range(i+1, length):
if nums[j] != 0:
nums[i] = nums[j]
nums[j] = 0
i = j
break
```

Share It, If You Like It.