leetcode No283. Move Zeroes

Posted 2022-06-11 Dufre.WC

Question

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.

Example:

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

Algorithm

• 遇到0怎么处理：用一个变量记录0的个数p
• 如何使下标index移动到正确的位置？
  • 与前面统计的0的个数有关系：index - p

Code

class Solution 
public:
    void moveZeroes(vector<int>& nums) 
        int p = 0;
        for (int i=0;i<nums.size();i++)
            if (nums[i] == 0)
                p++;
            
            else
                nums[i-p] = nums[i];
            
        
        for (int j=nums.size()-p;j<nums.size();j++)
            nums[j] = 0;
        
    
;

开发者涨薪指南 48位大咖的思考法则、工作方式、逻辑体系