leetcode 283. Move Zeroes

缺乏、安全感 2022-06-08 14:21 183阅读 0赞

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.

题意很简单，直接从数组末端移动即可。

代码如下：

/*
     * 简单的数组末端遍历，然后移动所有的0
     * */
    class Solution
    {
        public void moveZeroes(int[] nums) 
        {
            if(nums==null || nums.length<=1)
                return ;        
            for(int i=nums.length-1;i>=0;i--)
            {
                if(nums[i]==0)
                {
                    int j=i;
                    //当下一个元素存在并且不为0的时候就发生交换
                    while( j+1<nums.length && nums[j+1]!=0)
                    {
                        int tmp=nums[j];
                        nums[j]=nums[j+1];
                        nums[j+1]=tmp;
                        j++;
                    }
                }
            }
        }
    }

下面是C++的做法，就是做一个简单的交换即可

代码如下：

#include <iostream>
    #include <vector>
    #include <map>
    #include <set>
    #include <queue>
    #include <stack>
    #include <string>
    #include <climits>
    #include <algorithm>
    #include <sstream>
    
    using namespace std;
    
    class Solution 
    {
    public:
        void moveZeroes(vector<int>& a) 
        {
            for (int i = a.size() - 1; i >= 0; i--)
            {
                if (a[i] == 0)
                {
                    int j = i + 1;
                    while (j < a.size())
                    {
                        if (a[j] == 0)
                            break;
                        else
                            a[j - 1] = a[j];
                        j++;
                    }
                    a[j - 1] = 0;
                }
            }
        }
    };