[LeetCode练习题-C语言]之 Move Zeros

最新推荐文章于 2021-05-19 12:42:37 发布

jessica-Jiang

最新推荐文章于 2021-05-19 12:42:37 发布

阅读量596

点赞数

分类专栏： C 文章标签： leetcode c语言

本文链接：https://blog.youkuaiyun.com/u010738604/article/details/51995013

版权

C 专栏收录该内容

8 篇文章

订阅专栏

[LeetCode练习题-C语言]之 Move Zeros

题目

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.

我的代码：

void moveZeroes(int* nums, int numsSize) {
    int i,j,zero=0;
    for(i = 0; i < numsSize - zero; i++){
        if(nums[i] == 0){
            printf("%d\n",i);
            zero ++;
            for(j = i--; j < numsSize - zero; j++)
                nums[j] = nums[j + 1];
            nums[j] = 0;

        }
    }
}

别人写的代码

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