283. Moving zero-c and language assisted array method

283. Move zero -c And language assisted array method

Given an array nums, Write a function that will 0 Move to end of array , While maintaining the relative order of non-zero elements .

Please note that , You must operate on the array in place without copying it .

Example 1:

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

Example 2:

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

For this question , We can have many algorithms to deal with this problem , But personally , Still use some conventional methods , It's not easy to have an accident , You can solve problems quickly and easily in the exam or interview , The solution code is as follows ：

void moveZeroes(int* nums, int numsSize){
    
    int aid[numsSize];
    int size1=0;
    int size2=0;
    int i;
    for(i=0;i<numsSize;i++){
    
        if(nums[i]!=0){
    
            nums[size1++]=nums[i];
        }
        else{
    
        aid[size2++]=nums[i];
        }
    }
    for(i=0;i<size2;i++){
    
        nums[size1++]=aid[i];
    }

}