LeetCode Problem #283 : Move Zeroes

Question:

Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. Note that you must do this in-place without making a copy of the array.

Example 1:
    Input: nums = [0,1,0,3,12]
    Output: [1,3,12,0,0]

Example 2:
    Input: nums = [0]
    Output: [0]

Constraints:

Irrelevant

Initial Solution:

Easy stuff. 🙂

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

Peformance:

N/A