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.
# -*- coding:utf-8 -*-
class Solution(object):
def moveZeroes(self, nums):
return nums.sort(key=lambda x:1 if x==0 else 1)
if __name__ == '__main__':
print(Solution().moveZeroes([0, 1, 0, 3, 12]))
# def moveZeroes(self, nums):
# # lastZero 用于保存 list 最前方的 0 的下标
# # 类比冒泡排序
# lastZero = 0
# for i in range(len(nums)):
# if nums[i]:
# nums[i], nums[lastZero] = nums[lastZero], nums[i]
# lastZero += 1
# return nums
nums.sort(key=lambda x:1 if x==0 else 1)
该语句表示,将 lambda 匿名函数应用于每一个 nums 的元素,之后将其进行排序