Given an integer array nums
, move all 0
's to the end of it while maintaining the relative order of the non-zero elements.
Note that you must do this in-place without making a copy of the array.
Example 1:
Input: nums = [0,1,0,3,12] Output: [1,3,12,0,0]
Example 2:
Input: nums = [0] Output: [0]
Constraints:
1 <= nums.length <= 104
-231 <= nums[i] <= 231 - 1
Follow up: Could you minimize the total number of operations done?
A:
class Solution { public: void moveZeroes(vector<int>& nums) { int n = nums.size(); int j = 0; while(j<n && nums[j]==0){ // first none zero remaining; j++; } int i =0; for(;i<n;++i){ if(j>=n){ nums[i]=0; }else{ swap(nums[i],nums[j]); j++; while(j<n && nums[j]==0){ // first none zero remaining; j++; } } } } };
No comments:
Post a Comment