Tag: Array、Two Pointers
Difficulty: Medium
Description:
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].
Code:
O(n)
class Solution(object):
def moveZeroes(self, nums):
"""
:type nums: List[int]
:rtype: void Do not return anything, modify nums in-place instead.
"""
i = 0
j = 0
while(i<len(nums)):
if nums[i]!=0:
nums[j]=nums[i]
j = j+1
i = i+1
while(j<len(nums)):
nums[j] = 0
j = j+1