Move Zeroes

最新推荐文章于 2020-03-22 19:06:20 发布

J1n5555

最新推荐文章于 2020-03-22 19:06:20 发布

阅读量492

点赞数

分类专栏： LeetCode算法文章标签： Move Zeroes Leetcode 算法

本文链接：https://blog.csdn.net/J1n5555/article/details/48601639

版权

LeetCode算法专栏收录该内容

33 篇文章 0 订阅

订阅专栏

题目描述：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.

解题思路：只需拿最前面那个0与后面碰到的非零元素交换位置

python代码实现：

class Solution(object):
    def moveZeroes(self, nums):
        """
        :type nums: List[int]
        :rtype: void Do not return anything, modify nums in-place instead.
        """
        length=len(nums)
        before=-1
        after=-1
        for i in range(length):
            if nums[i]==0 and before==-1:
                before=i
            elif nums[i]!=0 and before!=-1:
                temp=nums[i]
                nums[i]=nums[before]
                nums[before]=temp
                before=before+1