[C语言][LeetCode][283]Move Zeroes

题目

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.

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.

标签

Array、Two Pointers

难度

简单

分析

题目意思是将一个数组里面的0全部往后放。解题思路是利用双指针，i指向0的元素，j指向非0的元素，从头开始遍历，如果遇到i和j的位置不相等，则交换i和j的内容，并将j的内容置为0。

C代码实现

void moveZeroes(int* nums, int numsSize) 
{
    int i=0, j=0;

    while(j<numsSize) 
    {  
        if(nums[j]!=0) 
        {  
            if(j!=i) 
            {   
                nums[i++] = nums[j];  
                nums[j] = 0;  
            } 
            else 
            {  
                ++i;  
            }  
        }   
        ++j;  
    } 
}