283. Move Zeroes

Posted 2021-11-29 dmndxld

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:

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

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)

执行用时 : 136 ms, 在Move Zeroes的Python3提交中击败了34.53% 的用户

内存消耗 : 14.3 MB, 在Move Zeroes的Python3提交中击败了88.24% 的用户

 

ok,admire this one

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 我佛了