[LeetCode]283. Move Zeroes ★

题目描述

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.
题目大意：给定一个数组，试写一个函数将数组中的0移到最后，但要保持数组中其他元素的相对位置不要改变。

样例

Example:

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

python解法

class Solution:
    def moveZeroes(self, nums: List[int]) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        num = nums.count(0)
        for i in range(num):
            nums.remove(0)
            nums.append(0)

Runtime: 108 ms, faster than 21.01% of Python3 online submissions for Move Zeroes.
Memory Usage: 15.2 MB, less than 5.97% of Python3 online submissions for Move Zeroes.
题后反思：

1. 因为python中实现了一些算法，所以直接调用很方便。

C语言解法

void moveZeroes(int* nums, int numsSize){
    int k = 0, t;
    for (int i=0;i<numsSize;i++)
    {
        while (i+k < numsSize && nums[i+k] == 0)
            k++;
        if (i+k>=numsSize)
            break;
        nums[i] = nums[i+k];
    }
    for (int i=k;i>0;i--)
        nums[numsSize-i]=0;
}

Runtime: 12 ms, faster than 89.22% of C online submissions for Move Zeroes.
Memory Usage: 9 MB, less than 60.00% of C online submissions for Move Zeroes.
题后反思：

1. i 指向的位置被用来存放非0的元素，i+k用来判断该位置是否是0

文中都是我个人的理解，如有错误的地方欢迎下方评论告诉我，我及时更正，大家共同进步