您的位置:首页 > 编程语言 > Python开发

LeetCode OJ 系列之283 Move Zeroes --Python

2015-11-17 09:00 621 查看
Problem:

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:

You must do this in-place without making a copy of the array.
Minimize the total number of operations.

Answer:

class Solution(object):
def moveZeroes(self, nums):
"""
:type nums: List[int]
:rtype: void Do not return anything, modify nums in-place instead.
"""
oldlen = len(nums)
tmplist = filter(lambda x:x !=0,nums)
del nums[:]
for i in range(oldlen):
if i< len(tmplist):
nums.append(tmplist[i])
else:
nums.append(0)
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  LeetCode Python OJ