Leetcode-move Zeroes

Leetcode-move Zeroes

Given an array nums , write a function to move all's to the 0 end of it while maintaining the relative order of the No N-zero elements.

For example, given nums = [0, 1, 0, 3, 12] , after calling your function, nums should is [1, 3, 12, 0, 0] .

Note:

1. You must does this in-place without making a copy of the array.
2. Minimize The total number of operations.

classSolution { Public:    voidMovezeroes (vector<int>&nums) {        intpos =-1, i =0;  while(i<nums.size ()) {            if(Nums[i]! =0) {nums[++pos] =Nums[i]; } I++; }         while(pos+1<nums.size ()) {nums[++pos]=0; }    }};

Idea: First the non-zero number to the front, and record the last position of the non-zero, and then the other numbers are set to 0.

Time complexity O (n), Spatial complexity O (1)

Leetcode-move Zeroes