1.1 Move Zeroes

Description

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: You must do this in-place without making a copy of the array. Minimize the total number of operations.

Method

Use two points one for marking last position of no-zero elements in the process one for loop array to search no-zero elements

Time and Space Complexity

time : o(2n) space : in-place o(1)

Code

public class Solution {

public void moveZeroes(int[] nums) {
     if (nums == null || nums.length == 0){
         return;
     }
     int index = 0;
     for (int i = 0; i < nums.length; i++){
          if (nums[i] != 0){
              nums[index++] = nums[i];
          }
     }
     while (index < nums.length){
         nums[index++] = 0;
     }
     return;
}

}