leetcode 283. Move Zeroes

传送门

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:

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

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

Hide Tags

 Array Two Pointers

Show Similar Problems

 

 

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int i;
        int j;
        int cou = 0;
        int n = nums.size();
        for(i = 0 ; i<n ; i++){
            if(nums[i] == 0){
                cou ++;
            }
        }
        for(i = 0,j = 0; i<n; i++){
            if(nums[i] != 0 ){
                nums[j] = nums[i];
                j++;
            }
        }
        for(;j<n;j++){
            nums[j] = 0;
        }
    }
};