标签:pytho 提交 ber eve ota ext operation main ace
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:
My idea:count 0 del ‘em and add
class Solution: def moveZeroes(self, nums: List[int]) -> None: """ Do not return anything, modify nums in-place instead. """ n=nums.count(0) for i in range(n): nums.remove(0) need=[0]*n nums.extend(need)
class Solution: def moveZeroes(self, nums: List[int]) -> None: """ Do not return anything, modify nums in-place instead. """ nums.sort(key=bool, reverse=True)
key=bool reverse=True 我佛了
标签:pytho 提交 ber eve ota ext operation main ace
原文地址:https://www.cnblogs.com/dmndxld/p/10853100.html