Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 28 additions & 0 deletions src/main/java/com/thealgorithms/misc/MoveZeroes.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
package com.thealgorithms.misc;

/**
* Moves all zeroes in an array to the end while maintaining the relative
* order of non-zero elements. The operation is performed in-place.
*
* <p>Example: [0, 1, 0, 3, 12] -> [1, 3, 12, 0, 0]
*
* <p>Time complexity: O(n), Space complexity: O(1)
*
* @see <a href="https://leetcode.com/problems/move-zeroes/">LeetCode #283</a>
*/
public final class MoveZeroes {
private MoveZeroes() {
}

public static void moveZeroes(int[] nums) {
int insertPos = 0;
for (int num : nums) {
if (num != 0) {
nums[insertPos++] = num;
}
}
while (insertPos < nums.length) {
nums[insertPos++] = 0;
}
}
}
36 changes: 36 additions & 0 deletions src/test/java/com/thealgorithms/misc/MoveZeroesTest.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
package com.thealgorithms.misc;

import static org.junit.jupiter.api.Assertions.assertArrayEquals;

import org.junit.jupiter.api.Test;

public class MoveZeroesTest {

@Test
public void testMoveZeroes() {
int[] nums = {0, 1, 0, 3, 12};
MoveZeroes.moveZeroes(nums);
assertArrayEquals(new int[] {1, 3, 12, 0, 0}, nums);
}

@Test
public void testNoZeroes() {
int[] nums = {1, 2, 3};
MoveZeroes.moveZeroes(nums);
assertArrayEquals(new int[] {1, 2, 3}, nums);
}

@Test
public void testAllZeroes() {
int[] nums = {0, 0, 0};
MoveZeroes.moveZeroes(nums);
assertArrayEquals(new int[] {0, 0, 0}, nums);
}

@Test
public void testSingleElement() {
int[] nums = {0};
MoveZeroes.moveZeroes(nums);
assertArrayEquals(new int[] {0}, nums);
}
}
Loading