[leetcode] 283. Move Zeroes

题目

Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.

Note that you must do this in-place without making a copy of the array.

Example 1:

Input: nums = [0,1,0,3,12]
Output: [1,3,12,0,0]

Example 2:

Input: nums = [0]
Output: [0]

Constraints:

• 1 <= nums.length <= 104
• -231 <= nums[i] <= 231 - 1

Follow up: Could you minimize the total number of operations done?

思路

双指针，一个指针用来遍历数组，一个指针用来表示应当插入非零数值的位置。

代码

python版本：

class Solution:
    def moveZeroes(self, nums: List[int]) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        l=len(nums)
        pos=0
        for i in range(l):
            if nums[i]!=0:
                nums[pos]=nums[i]
                pos+=1
        for i in range(pos,l):
            nums[i]=0
        return nums