Coding interview problem : move all zeros present in the array to the end, and return the SAME array.

move_zeros.py

# Move all zeros present in the array to the end, and return the SAME array.
#
# I: [0, 1, 2, 0, 3, 0]
# O: [1, 2, 3, 0, 0, 0]
#
# No empty array.
# No negative numbers.

def shiftZeros(array):
	i = 0
	while (i < len(array)):
		if (array[i] == 0):
			while (len(array) > i + 1 and array[i + 1] != 0):
				array[i] = array[i + 1]
				array[i + 1] = 0
				i += 1
			i += 1
		else:
			memo = i
			while (i > 0 and array[i - 1] == 0):
				array[i - 1] = array[i]
				array[i] = 0
				i -= 1
			i = memo + 1
		i += 1
	return array

print shiftZeros([0, 1, 2, 0, 3, 0, 6])