leetcode Move Zeroes

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

小菜鸟的leetcode

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

阅读量284

点赞数

分类专栏： leetcode 文章标签：双指针

本文链接：https://blog.csdn.net/Scarlett_leetcode/article/details/50461853

版权

leetcode 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

Problem

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.

Solution 1 :

大体思路是利用两个指针 p0 和 p1 从前往后扫， p0去找为零的， p1去找非零的，找到之后交换下。

需要注意已经排序好的test case ，如｛ 1，0 ｝

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        const int N = nums.size();
        for(int p0 = 0, p1 = 0; p0 < N && p1 < N;){
            if(nums[p0] != 0) {p0++; <span style="color:#ff0000;">p1 = p0;</span> continue;} // p1 需要在 p0后面，否则｛1，0｝不通过
            if(nums[p1] == 0) {p1++; continue;} // find none zero
            swap(nums[p0++], nums[p1++]);
         
        }
    }
};

Solution 2 :

code更加简洁，思路一致

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        const int N = nums.size();
        for( int p0 = 0, p1 = 0; p1 < N; p1++){
            if(nums[p1]) {
                swap(nums[p0++], nums[p1]);
            }
        }
    }
};