forked from Garvit244/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
283.py
27 lines (22 loc) · 762 Bytes
/
283.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
'''
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:
You must do this in-place without making a copy of the array.
Minimize the total number of operations.
'''
class Solution(object):
def moveZeroes(self, nums):
"""
:type nums: List[int]
:rtype: void Do not return anything, modify nums in-place instead.
"""
zeroIndex = 0
for index in range(len(nums)):
if nums[index] != 0:
nums[zeroIndex] = nums[index]
zeroIndex += 1
for index in range(zeroIndex, len(nums)):
nums[index] = 0