Leetcode #283. Move Zeroes — Java Solution and Explanation

Problem Description

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:

• 1 <= nums.length <= 104
• -231 <= nums[i] <= 231 - 1

Follow up: Could you minimize the total number of operations done?

Solution

Leetcode Proof

The solution in this article is 100% faster than other Java submissions online.

Java Solution

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

Strategy

To be able to come up with the solution for this question, you would have to know the following: