[LeetCode] Move Zeroes - 整数数组处理问题

void moveZeroes(int* nums, int numsSize) {
    int endNum;        //从后计数0
    int startNum;      //从前计数非0
    int temp;
    int i,j;
    
    i = 0;
    startNum = 0;
    endNum = 0;
    while( (i+endNum) < numsSize ) {
        if(nums[i]==0) {
            //依次前移
            for(j=startNum; j<numsSize-endNum-1; j++) { //j少一个数
                nums[j] = nums[j+1];
            }
            nums[numsSize-endNum-1] = 0;
            endNum++;
        }
        else {
            nums[startNum] = nums[i];
            startNum++;
            i++;
        }
    }
}

void moveZeroes(int* nums, int numsSize) {
    int count;   //计算0的个数
    int i,j;
    int n;
    
    n = 0;
    count = 0;
    for(i=0; i<numsSize; i++) {
        if(nums[i]==0) {
            count++;
        }
        else  {
            nums[n] = nums[i];
            n++;
        }
    }
    //后置0
    for(j=0; j<count; j++) {
        nums[n] = 0;
        n++;
    }
}