283. Move Zeroes Leetcode Java Solutin

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.

 

public class Solution {
    public void moveZeroes(int[] nums) {
        int pos = 0;
        for(int i =0; i< nums.length; i++){
            if(nums[i] != 0){
                nums[pos++] = nums[i];
            }
        }
        for(;pos< nums.length; pos ++)
            nums[pos] = 0;
    }
}

 双指针压缩法。