283. Move Zeroes

Posted 2020-12-30 stiles

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.

Solution: make a queu and coun the number of 0 or use two pointers clerverly(think aboun the logic)

class Solution {
    public void moveZeroes(int[] nums) {
        //two pointers, move zero to the end of the array, we surely know how many 0 we have, 
        int j = 0;
        for(int i = 0; i<nums.length; i++){
            //if there is 0 j will not inncrease,  will increase
            if(nums[i] != 0){//not 0
                nums[j] = nums[i]; // move ele[i] to ele[j]
                j++;//move to next
            }
        }
        for(int i = j; i<nums.length; i++){
            nums[i] = 0;   
        }
    }
}