企业官网建设流程全解析

问题描述：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]

Note:

You must do this in-place without making a copy of the array. Minimize the total number of operations.

难度等级：简单

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

(⊙o⊙)嗯